Search a 2D Matrix
mediumYou are given an `m x n` integer matrix `matrix` with the following two properties:
- Each row is sorted in non-decreasing order. - The first integer of each row is greater than the last integer of the previous row.
Given an integer `target`, return `true` if `target` is in `matrix` or `false` otherwise.
You must write a solution in `O(log(m * n))` time complexity.
Example 1
Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3
Output: true
Explanation: 3 is present in the matrix.
Example 2
Input: matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13
Output: false
Explanation: 13 is not present in the matrix.
Constraints
m == matrix.lengthn == matrix[i].length1 <= m, n <= 100-10^4 <= matrix[i][j], target <= 10^4
Loading editor...
Test Cases
Click "Run" to execute your code against test cases
← Binary SearchNext →