题解 | #二维数组的线性搜索#

# https://www.nowcoder.com/issue/tutorial?zhuanlanId=J0elbM&uuid=0524b9ad9135412ab3c8c4b9809f537f
class Solution:
    def Find(self, target: int, array: list[list[int]]) -> bool:
        if not array or not array[0]: return False
        r = len(array)
        c = len(array[0])
        i = r - 1
        j = 0 # 从左下角开始搜索
        while i >= 0 and j < c: # 边界判断
            if target == array[i][j]:
                return True
            elif target > array[i][j]: # 小了往右
                j += 1
            elif target < array[i][j]: # 大了往上
                i -= 1
        return False

if __name__ == '__main__':
    solution = Solution()
    # Example 1 -> True
    target = 7
    array = [[1,2,8,9],[2,4,9,12],[4,7,10,13],[6,8,11,15]]
    # Example 2 -> False
    target = 3
    result = solution.Find(target, array)
    print(result)