LeetCode medium topic search of two-dimensional matrix

Title

Write an efficient algorithm to determine whether a target value exists in an m x n matrix.The matrix has the following properties:

Integers in each line are in ascending order from left to right.
The first integer of each line is greater than the last integer of the previous line.

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

Tip:

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

Source: LeetCode

Solution ideas

   The problem is not difficult. The intuitive idea is to directly flatten the matrix into a 1-dimensional array, and then use binary search.

class Solution:def searchMatrix(self, matrix: List[List[span>int]], target: int) -> bool:temp=[]for i in matrix:temp.extend(i)return temp[bisect.bisect(temp,target)-1]==target