搜索二维矩阵-数组74-python

二分查找

python

class Solution:
    def searchMatrix(self, matrix: List[List[int]], target: int):
        m = len(matrix)
        n = len(matrix[0])

        for line in matrix:
            if target < line[0] or target > line[-1]:
                continue
            else:
                left, right = 0, n-1
                while left <= right:
                    mid = int((left + (right-left)/2))

                    if line[mid] == target:
                        return True
                    elif line[mid] < target:
                        left = mid + 1
                    elif line[mid] > target:
                        right = mid - 1
        
        return False