leetcode:240 递增二维数组中的查找

从左下或者右上角开始比较

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