Description
You are given an m x n integer matrix with the following 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:
matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 3Output:
trueExplanation:
3 exists in the matrix.
Input:
matrix = [[1,3,5,7],[10,11,16,20],[23,30,34,60]], target = 13Output:
falseExplanation:
13 does not exist in the matrix.
Input:
matrix = [[1]], target = 1Output:
trueExplanation:
A 1x1 matrix contains only 1, which matches the target. Binary search finds it immediately.
Constraints
- •
m == matrix.length - •
n == matrix[i].length - •
1 ≤ m, n ≤ 100 - •
-10⁴ ≤ matrix[i][j], target ≤ 10⁴