Leetcode 240.Search a 2D Matrix II（第十三周作业）

先贴原题：

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 in ascending from left to right.
• Integers in each column are sorted in ascending from top to bottom.

For example,

Consider the following matrix:

[
  [1,   4,  7, 11, 15],
  [2,   5,  8, 12, 19],
  [3,   6,  9, 16, 22],
  [10, 13, 14, 17, 24],
  [18, 21, 23, 26, 30]
]

Given target = 5, return true.

Given target = 20, return false.

刚开始我就简单地去遍历这个matrix并设置了一些限制条件，结果发现Runtime倒数了。排位为2.24%(倒数)
代码如下

class Solution(object):
    def searchMatrix(self, matrix, target):
        """ :type matrix: List[List[int]] :type target: int :rtype: bool """
        for i in range(len(matrix)):
            for j in range(len(matrix[i])):
                if matrix[i][j] == target:
                    return True
                elif matrix[i][j] > target:
                    break
            if matrix[i] and matrix[i][0] > target:
                return False
        return False

然后就试着用了二分法来找。排位为21.28%左右，代码如下：

class Solution(object):
    def searchMatrix(self, matrix, target):
        """ :type matrix: List[List[int]] :type target: int :rtype: bool """
        def bs(nums, target):
            l, r = 0, len(nums) - 1
            while l <= r:
                mid = (l + r) / 2
                if nums[mid] == target: return True
                elif nums[mid] > target: r = mid - 1
                else: l = mid + 1
            return False
        
        for i in range(len(matrix)):
            if matrix[i] and matrix[i][0] > target: return False
            if matrix[i]:
                if bs(matrix[i], target): return True
        return False

最后看到讨论才发现其实我漏了Integers in each column are sorted in ascending from top to bottom.这个重要条件。
所以这道题应该从右上角开始搜索，如果右上角比target小，则行数增加，否则列数减少，以此类推。这个算法可以beats82.31%的submissions

class Solution(object):
    def searchMatrix(self, matrix, target):
        """ :type matrix: List[List[int]] :type target: int :rtype: bool """
        if not matrix or not matrix[0]: return False
        r, c = 0, len(matrix[0]) - 1
        while r <= len(matrix) - 1 and c >= 0:
            if matrix[r][c] == target:
                return True
            if matrix[r][c] < target:
                r += 1
            else:
                c -= 1
        return False