问题描述:
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.
Example 1:
Input: matrix = [ [1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 50] ] target = 3 Output: true
Example 2:
Input: matrix = [ [1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 50] ] target = 13 Output: false
源码:
剑指offer第四题剑指offer总纲。
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if(matrix.size()==0) return false;
if(matrix[0].size()==0) return false;
int rows=matrix.size(), cols=matrix[0].size();
int row=0, col=cols-1;
while(row<rows && col>=0){
if(target == matrix[row][col]) return true;
else if(target < matrix[row][col]) col--;
else row++;
}
return false;
}
};