leetcode-240 搜索二维矩阵

题目描述：

每一步都要想清楚，不要含糊

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