🧙‍♂️(binary-search): 74. 搜索二维矩阵 修改解题方法

Author: JalanJiang

docs/algorithm/research/binary-search/README.md

@@ -280,9 +280,9 @@ class Solution:
             while left <= right:
                 middle = left + (right - left) // 2
                 if matrix[i][middle] > target:
-                    right -= 1
+                    right = middle - 1
                 elif  matrix[i][middle] < target:
-                    left += 1
+                    left = middle + 1
                 else:
                     return True