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.

思路：我一开始从（0,0）向右下搜索，后来发现一直报错，才发现思路有问题，因为向右和向下两个方向数据都是增大的，所以当target大于某个元素时，无法选择下一步的路径，所以应该从右上向左下走，或者反过来，这样两个路径的方向才是不同的，才具有选择性。

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