74. Search a 2D Matrix

74. Search a 2D Matrix

Medium

3135195Add to ListShare

Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:

• Integers in each row are sorted from left to right.
• The first integer of each row is greater than the last integer of the previous row.

 

Example 1:

Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
Output: true

Example 2:

Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
Output: false

 

Constraints:

• m == matrix.length
• n == matrix[i].length
• 1 <= m, n <= 100
• -104 <= matrix[i][j], target <= 104

class Solution:
    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
        """
        解题思路：先找到所在的行，然后用二分查找，时间复杂度：O(n)
        """
        m = len(matrix)
        n = len(matrix[0])
        row = 0
        while row < m:
            if matrix[row][n - 1] == target:
                return True
            if matrix[row][n - 1] > target:
                break
            row += 1
        if row >= m:
            return False
        index = bisect.bisect_left(matrix[row], target)
        if matrix[row][index] == target:
            return True
        else:
            return False