题目
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
.
class Solution {
public boolean searchMatrix(int[][] matrix, int target) {int m = matrix.length;
if (m == 0) {
return false;
}
int n = matrix[0].length;
if (n == 0)
return false;
int l = 0, r = m * n - 1;
while (l != r) {
int mid = (l + r - 1) >> 1;
if (matrix[mid / n][mid % n] < target) {
l = mid + 1;
} else {
r = mid;
}
}
return matrix[r / n][r % n] == target;
}
}