Refactor https://leetcode.com/problems/search-a-2d-matrix/

Author: fspv

l33tcode/search-a-2d-matrix.py

@@ -1,21 +1,22 @@
+from typing import List
+
 class Solution:
     def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
         if not matrix:
             return False
 
-        left, right = 0, len(matrix) * len(matrix[0]) - 1
+        def get_value(pos: int):
+            row, col = pos // len(matrix[0]), pos % len(matrix[0])
+            return matrix[row][col]
 
-        while left <= right:
-            mid = (left + right) // 2
+        left, right = 0, len(matrix) * len(matrix[0]) - 1
 
-            row = mid // len(matrix[0])
-            col = mid % len(matrix[0])
+        while left < right:
+            mid = left + (right - left) // 2
 
-            if matrix[row][col] < target:
+            if get_value(mid) < target:
                 left = mid + 1
-            elif matrix[row][col] > target:
-                right = mid - 1
-            else:
-                return True
+            elif get_value(mid) >= target:
+                right = mid
 
-        return False
+        return get_value(left) == target