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
.
很经典的一道面试题。
1.Matrix[i][j] < Target,那么Matrix[i][0] ~ Matrix[i][j - 1]均 < Target;
2.Matrix[i][j] > Target,那么Matrix[i+1][j]~Matrix[m-1][j]均 > Target (矩阵为M*N)。
由这两个信息,我们就可以从矩阵的右上角,也就是Matrix[0][n - 1]开始搜寻Target。
如果Matrix[0][n-1] < Target,那么我们就可以排除掉第0行,此时的可能解存在于(M-1) * N的矩阵中;
如果Matrix[0][n-1] > Target,那么我们就可以排除掉第n-1列,此时的可能解存在于M * (N-1)的矩阵中。
对于新的矩阵,再次从它的右上角开始搜索Target。
直到找到Target或者无解。
class Solution {
public:
bool searchMatrix(vector<vector<int> > &matrix, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (matrix.empty() || matrix[0].empty()) {
return false;
}
int m = matrix.size(), n = matrix[0].size();
int x = 0, y = n - 1;
while (0 <= x && x < m && 0 <= y && y < n) {
if (matrix[x][y] == target) {
return true;
}
else if (matrix[x][y] > target) {
y--;
}
else {
x++;
}
}
return false;
}
};
public class Solution {
public boolean searchMatrix(int[][] matrix, int target) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if (matrix == null) {
return false;
}
int m = matrix.length, n = matrix[0].length;
int x = 0, y = n - 1;
while (x >= 0 && x < m && y >= 0 && y < n) {
if (matrix[x][y] == target) {
return true;
}
else if (matrix[x][y] > target) {
y--;
}
else {
x++;
}
}
return false;
}
}