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
解题思路:先确定在哪一行,然后在该行用二分法进行搜索
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if(matrix.size()==0||matrix[0].size()==0||matrix[0][0]>target)
return false;
int m=matrix.size(),n=matrix[0].size(),i=1;
if(matrix[m-1][n-1]<target)
return false;
while(i<m&&matrix[i][0]<=target)
i++;
i--;
int low=0,high=n-1;
while(low<=high){
int mid=(high+low)/2;
if(matrix[i][mid]==target)
return true;
else if(matrix[i][mid]>target)
high=mid-1;
else
low=mid+1;
}
return false;
}
};