Python. Super simple O(m + n). faster than 93.65%
```\nclass Solution:\n    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:\n        row, col, num_row = 0, len(matrix[0]) - 1, len(matrix)\
```\nclass Solution:\n    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:\n        row, col, num_row = 0, len(matrix[0]) - 1, len(matrix)\n        while col >= 0 and row < num_row:\n            if matrix[row][col] > target:\n                col -= 1\n            elif matrix[row][col] < target:\n                row += 1\n            else:\n                return True\n        return False
['Python', 'Python3']