【Leetcode】074 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.

例子

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

---

二分法查找

题目给的提示时间复杂度为$O（logn）$
这里采用的方式是，先确定所在行，然后确定所在列。两次查找都以二分法查找。
最后判断值是否等于target。肯定有优化解法。

class Solution(object):
    def searchMatrix(self, matrix, target):
        """
        :type matrix: List[List[int]]
        :type target: int
        :rtype: bool
        """
        if matrix == [] or matrix ==[[]]:
            return False
        top,bottom = 0,(len(matrix)-1)
        while(top<=bottom):
            mid = (top+bottom)//2
            tmp = matrix[mid][0]
            if target == tmp:
                return True
            elif target < tmp :
                bottom = mid - 1
            else:
                top = mid + 1
        col = bottom	#记录所在行，以bottom为界，保证取值时不越界
        left, right = 0, len(matrix[col]) - 1
        while(left<=right):
            mid = (left+right)//2
            tmp = matrix[col][mid]
            if target == tmp:
                return True
            elif target < tmp:
                right = mid - 1
            else:
                left = mid + 1
        raw = right	#记录列号
        # print(col,raw)
        # print(matrix[col][raw])
        if matrix[col][raw] != target:
            return False
        else:
            return True

Runtime: 52 ms, faster than 77.33% of Python online submissions for Search a 2D Matrix.
Memory Usage: 13.4 MB, less than 94.54% of Python online submissions for Search a 2D Matrix.