Create search-a-2d-matrix-2.py

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

@@ -0,0 +1,32 @@
+# https://leetcode.com/problems/search-a-2d-matrix/
+import bisect
+
+class Solution:
+    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
+        if len(matrix) == 0 or len(matrix[0]) == 0:
+            return False
+
+        low_l = 0
+        high_l = len(matrix) - 1
+
+        while low_l <= high_l:
+            mid_l = low_l + (high_l - low_l) // 2
+
+            if matrix[mid_l][0] == target:
+                return True
+            elif matrix[mid_l][0] < target:
+                if mid_l + 1 >= len(matrix) or matrix[mid_l + 1][0] > target:
+                    break
+                low_l = mid_l + 1
+            else:
+                high_l = mid_l - 1
+
+        if mid_l >= len(matrix):
+            return False
+
+        # print(f"mid_l: {mid_l}")
+        pos = bisect.bisect_left(matrix[mid_l], target)
+        # print(f"mid_l: {mid_l}, pos: {pos}")
+        if pos >= len(matrix[0]):
+            return False
+        return matrix[mid_l][pos] == target