240. 搜索二维矩阵 II

1. 题目链接

2. 解题思路：从右上角点，或者左下角点开始找即可。因为这两个点具有【单调性】

3. 代码

   class Solution:
       def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
           n = len(matrix)
           m = len(matrix[0])
           i = 0
           j = m - 1
           while i < n and j >= 0:
               if matrix[i][j] == target:
                   return True
               elif matrix[i][j] < target:
                   i += 1
               else:
                   j -= 1
           return False