leetcode day17 搜索二维矩阵

1.题目描述

2.代码构思（debug）

采用二分查找的方法遍历寻找
class Solution:

def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
    if not matrix:
        return False

    row = len(matrix) - 1
    col = len(matrix[0]) - 1

    i,j = 0,col

    while i <= row and j >= 0:
        if matrix[i][j] == target:
            return True
        elif matrix[i][j] > target:
            j -= 1
        else:
            i += 1

    return False