Cacher is the code snippet organizer for pro developers

class Solution(object):
    def searchMatrix(self, mat, target):
        """
        :type mat: List[List[int]]
        :type target: int
        :rtype: bool
        """
        if len(mat) == 0 or len(mat[0]) == 0:
            return False
        rowNum = len(mat)
        colNum = len(mat[0])
        rowIndex = 0
        colIndex = colNum - 1
        while colIndex >= 0 and rowIndex <= rowNum - 1:
            # Like previous `Search a 2D Matrix` problem,
            # except that the while loop will go for many times rather than just 1 or 2 times.
            if mat[rowIndex][colIndex] < target:
                rowIndex += 1
            elif mat[rowIndex][colIndex] > target:
                colIndex -= 1
            else:
                return True
        return False