Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
- Integers in each row are sorted from left to right.
- The first integer of each row is greater than the last integer of the previous row.
For example,
Consider the following matrix:
[ [1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 50] ]
Given target = 3
, return true
.
public class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
if (matrix.length == 0 || matrix[0].length == 0) {
return false;
}
int low = 0, high = matrix.length * matrix[0].length - 1;
while (low != high) {
int mid = (low + high - 1) >> 1;
if (matrix[mid / matrix[0].length][mid % matrix[0].length] < target) {
low = mid + 1;
} else {
high = mid;
}
}
return matrix[high / matrix[0].length][high % matrix[0].length] == target;
}
}