https://leetcode.com/problems/search-a-2d-matrix/
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if(matrix.size()==0||matrix[0].size()==0) return false;
int l=0,r=matrix.size()-1,mid=0;
while (l<=r) {
mid=(l+r)/2;
if(matrix[mid][0]==target) return true;
else if(matrix[mid][0]>target) r=mid-1;
else l=mid+1;
}
int row=r; //确定这一个row
if(row<0) return false;
l=0,r=matrix[0].size()-1;
while (l<=r) {
mid=(l+r)/2;
if(matrix[row][mid]==target) return true;
else if(matrix[row][mid]>target) r=mid-1;
else l=mid+1;
}
return false;
}
};