74. Search a 2D Matrix (Medium) - TengnanYao/daily_leetcode GitHub Wiki

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