70. Search a 2D Matrix
MediumBinary Search
You are given an m x n integer 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.
Examples
Input: [[1,3,5,7],[10,11,16,20],[23,30,34,60]] 3
Output: true
Explanation: 3 is at cell (0,1); binary search over the virtual sorted sequence finds it.
Constraints
- m == matrix.length
- n == matrix[i].length
- 1 <= m, n <= 100
- -10^4 <= matrix[i][j], target <= 10^4
Loading...
Run checks all cases above. Submit evaluates all test cases.