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:
bool searchMatrix(vector<vector<int> > &matrix, int target) {
int m = matrix.size();
if(m==0)
return false;
int n = matrix[0].size();
int row = 0,col = n-1;
while(row<m && col>=0){
if(matrix[row][col]==target)
return true;
if(matrix[row][col]>target){
col--;
}else{
row++;
}
}
return false;
}
};