leetcode——74.搜索二维矩阵

class Solution:
    def searchMatrix(self, matrix, target):
        """
        :type matrix: List[List[int]]
        :type target: int
        :rtype: bool
        """
        #print(len(matrix))#行数
        #print(matrix[0])
        #print(len(matrix[0]))#列数
        if len(matrix)==1:
            if target in matrix[0]:
                return True
            else:
                return False
        for i in range(len(matrix)):
            #print(matrix[i])
            if matrix[i][-1]<target:
                i+=1
            else:
                if target in matrix[i]:
                    return True
                else:
                    return False