Runtime: 38 ms (Top 96.94%) | Memory: 17.90 MB (Top 11.07%)

Author: AnasImloul

scripts/algorithms/S/Search a 2D Matrix/Search a 2D Matrix.py

@@ -1,23 +1,9 @@
+// Runtime: 38 ms (Top 96.94%) | Memory: 17.90 MB (Top 11.07%)
+
 class Solution:
     def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
-        left=0
-        right=len(matrix)-1
-        while left <= right:
-            mid=(left+right)//2
-            if matrix[mid][0] < target:
-                left = mid+1
-            elif matrix[mid][0] >target:
-                right= mid-1
-            else:
-                return True
-        left1=0
-        right1=len(matrix[right])-1
-        while left1 <= right1:
-            mid=(left1+right1)//2
-            if matrix[right][mid] < target:
-                left1 = mid+1
-            elif matrix[right][mid] >target:
-                right1= mid-1
-            else:
-                return True
-        return False
+        n = len(matrix[0])
+        def get(idx: int) -> int:
+            r, c = divmod(idx, n)
+            return matrix[r][c]
+        return get(bisect_left(range(len(matrix)*n-1), target, key=get)) == target