class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
ROWS = len(matrix)
COLS = len(matrix[0])
l, r = 0, COLS*ROWS - 1
while l<=r:
mid = (l+r)//2
rr = mid // COLS
cc = mid % COLS
if matrix[rr][cc] < target:
l = mid+1
elif matrix[rr][cc] > target:
r = mid-1
else:
return True
return False
'LeetCode > Top Interview 150' 카테고리의 다른 글
34. Find First and Last Position of Element in Sorted Array (0) | 2024.12.21 |
---|---|
BST: 33. Search in Rotated Sorted Array★★ (0) | 2024.12.21 |
35. Search Insert Position (0) | 2024.12.20 |
918. Maximum Sum Circular Subarray (0) | 2024.12.20 |
53. Maximum Subarray (0) | 2024.12.20 |