Search a 2D Matrix
MediumP2Coding
matrix is an m x n integer matrix with two properties: each row is sorted in non-decreasing order, and the first integer of each row is greater than the last integer of the previous row.
Return true if target is in the matrix and false otherwise. Aim for O(log(m * n)) time.
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
Example 3
- Input
- matrix = [[1]], target = 1
- Output
- true
Constraints
- 1 <= m, n <= 100
- -10^4 <= matrix[i][j], target <= 10^4
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 12. ⌘Enter runs, ⌘⇧Enter submits.