leetcode-240 two-dimensional matrix search

leetcode-240 two-dimensional matrix search

Subject description:

Prepared by an efficient algorithm to search m x n matrix of a target matrix target. This matrix has the following characteristics: the elements of each row in ascending order from left to right. Element of each column from top to bottom in ascending order.
Each step must be to think clearly, not vague

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