Python 小白的 Leetcode Daily Challenge 刷题计划 - 20230807

74. Search a 2D Matrix

难度：Medium

 

class Solution:
    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
        m = len(matrix)
        n = len(matrix[0])
        left = 0
        right = m * n + 1
        while left + 1 < right:
            mid = (left + right) >> 1
            if matrix[(mid-1) // n][(mid-1) % n] >= target:
                right = mid
            else:
                left = mid
        if right > m * n or matrix[(right-1) // n][(right-1) % n] != target:
            return False
        else:
            return True