原题地址:力扣
变种的二分搜索,看作一个数组就好。换一下坐标
'''
升序数组二分查找
'''
class Solution:
def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
m = len(matrix)
n = len(matrix[0])
r = m * n - 1
l = 0
while(l <= r):
mid = (l + r) // 2
now = matrix[mid // n][mid % n]
if now > target:
r = mid - 1
elif now < target:
l = mid + 1
else:
return True
return False