Binary Search | Linear Solution
\nclass Solution:\n    def searchMatrix(self, matrix, target):\n        """\n        :type matrix: List[List[int]]\n        :type target: int\n        :rtype: b
```\nclass Solution:\n    def searchMatrix(self, matrix, target):\n        """\n        :type matrix: List[List[int]]\n        :type target: int\n        :rtype: bool\n        """\n        if not matrix or not matrix[0]:\n            return False\n        \n        i = 0\n        j = len(matrix[0]) - 1\n        \n        while i < len(matrix) and j>=0:\n            \n            if matrix[i][j]==target:\n                return True\n            \n            elif matrix[i][j] > target:\n                j -= 1\n            \n            else:\n                i += 1\n        \n        return False\n```\n
['Binary Search', 'Binary Tree', 'Python', 'Python3']