Python | Leetcode Python题解之第240题搜索二维矩阵II

题目：

题解：

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