LeetCode74——Search a 2D Matrix

题目链接

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, 50]
]
target = 3
Output: true

Example 2:

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

代码

class Solution:
    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
        if len(matrix) <= 0:
            return False
        if len(matrix[0])<=0:
            return False

        rows = len(matrix)
        cols = len(matrix[0])

        begin = 0
        end = rows*cols
        if matrix[rows-1][cols-1]< target or matrix[0][0] > target:
            return False
        if matrix[rows-1][cols-1] == target or matrix[0][0] == target:
            return True

        mid = (begin + end) // 2
        while begin != end and begin != end-1:
            tempRow = mid // cols
            tempCol = mid % cols
            if tempCol != 0:
                tempRow = tempRow + 1

            if matrix[tempRow-1][tempCol-1] > target:
                end = mid
            if matrix[tempRow-1][tempCol-1] < target:
                begin = mid
            if matrix[tempRow-1][tempCol-1] == target:
                return True

            mid = (begin + end) // 2
        return False

运行结果

Runtime: 40 ms, faster than 73.80% of Python3 online submissions for Search a 2D Matrix.
Memory Usage: 14 MB, less than 5.71% of Python3 online submissions for Search a 2D Matrix.