74. 搜索二维矩阵

中等

题目描述

解法思路： 二维矩阵的二分查找，mid = (left + right) // 2; x = matrix[mid // n][mid % n]

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