We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 8ec7c1c commit 91ea71dCopy full SHA for 91ea71d
C++/campus-bikes-ii.cpp
@@ -1,8 +1,8 @@
1
// Time: O(w * b * 2^b)
2
// Space: O(w * b * 2^b)
3
4
-// if w = b, we can even apply Hungarian algorithm (https://en.wikipedia.org/wiki/Hungarian_algorithm)
5
-// it can be improved to O(w^3), (https://github.com/t3nsor/codebook/blob/master/bipartite-mincost.cpp)
+// if w = b, we can even apply Hungarian algorithm (see https://en.wikipedia.org/wiki/Hungarian_algorithm),
+// it can be improved to O(w^3), see https://github.com/t3nsor/codebook/blob/master/bipartite-mincost.cpp
6
class Solution {
7
public:
8
int assignBikes(vector<vector<int>>& workers, vector<vector<int>>& bikes) {
0 commit comments