class Solution(object):
def searchMatrix(self, matrix, target):
"""
:type matrix: List[List[int]]
:type target: int
:rtype: bool
"""
m = len(matrix)
if m==0:
return False
n = len(matrix[0])
i=0
j=n-1
while i<m and j>=0:
if target == matrix[i][j]:
return True
elif target > matrix[i][j]:
i+=1
else:
j-=1
return False
python leetcode 240. Search a 2D Matrix II
最新推荐文章于 2024-10-03 09:02:12 发布