Update median-of-two-sorted-arrays.cpp

kamyu104 · kamyu104 · commit 6b6e331a99ca · 2016-05-28T22:18:40.000+08:00
diff --git a/C++/median-of-two-sorted-arrays.cpp b/C++/median-of-two-sorted-arrays.cpp
@@ -87,14 +87,14 @@ class Solution_Generic {
         return right;
     }
 
-    bool match(const vector<vector<int> *>& arrays, int target, int k) {
+    bool match(const vector<vector<int> *>& arrays, int num, int target) {
         int res = 0;
         for (const auto array : arrays) {
             if (!array->empty()) {
-                res += distance(upper_bound(array->cbegin(), array->cend(), target),
+                res += distance(upper_bound(array->cbegin(), array->cend(), num),
                                 array->cend());
             }
         }
-        return res < k;
+        return res < target;
     }
 };

Original file line number	Diff line number	Diff line change
`@@ -87,14 +87,14 @@ class Solution_Generic {`
`87`	`87`	`return right;`
`88`	`88`	`}`
`89`	`89`
`90`		`- bool match(const vector<vector<int> *>& arrays, int target, int k) {`
	`90`	`+ bool match(const vector<vector<int> *>& arrays, int num, int target) {`
`91`	`91`	`int res = 0;`
`92`	`92`	`for (const auto array : arrays) {`
`93`	`93`	`if (!array->empty()) {`
`94`		`- res += distance(upper_bound(array->cbegin(), array->cend(), target),`
	`94`	`+ res += distance(upper_bound(array->cbegin(), array->cend(), num),`
`95`	`95`	`array->cend());`
`96`	`96`	`}`
`97`	`97`	`}`
`98`		`- return res < k;`
	`98`	`+ return res < target;`
`99`	`99`	`}`
`100`	`100`	`};`