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

kamyu104 · web-flow · commit dc28ac4be8cc · 2017-12-21T10:47:07.000-06:00
diff --git a/C++/median-of-two-sorted-arrays.cpp b/C++/median-of-two-sorted-arrays.cpp
@@ -25,7 +25,7 @@ class Solution {
         int left = 0;
         int right = m;
         // Find a partition of A and B
-        // where min left s.t. A[left] >= B[k - 1 - left]. Thus left is the (k + 1)-th element.
+        // where min left s.t. A[left - 1] >= B[k - 1 - left]. Thus left is the k-th element.
         while (left < right) {
             int mid = left + (right - left) / 2;
             if (0 <= k - 1 - mid && k - 1 - mid < n && A[mid] >= B[k - 1 - mid]) {
