[Leetcode]74. Search a 2D Matrix - Python Solution

Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties:

Integers in each row are sorted from left to right.
The first integer of each row is greater than the last integer of the previous row.

Example 1:

Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
Output: true
Example 2:

Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
Output: false

Constraints:

m == matrix.length
n == matrix[i].length
1 <= m, n <= 100
-104 <= matrix[i][j], target <= 104

class Solution:
    def searchMatrix(self, matrix: List[List[int]], target: int) -> bool:
        n=len(matrix)*len(matrix[0])
        start=0
        end=n-1
        while start<=end:
            mid=(start+end)//2
            row=mid//len(matrix[0])
            column=mid%len(matrix[0])
            if matrix[row][column]==target:
                return True
            elif matrix[row][column]>target:
                end-=1
            else:
                start+=1
        return False        

##