class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
int m=matrix.size();
int n=matrix[0].size();
int left=0,right=m*n-1,mid;
if(matrix[0][0]==target||matrix[m-1][n-1]==target)
return true;
while(left<right)
{
mid=(left+right)/2;
int r=mid/n;
int c=mid%n;
if(matrix[r][c]==target)
return true;
if(matrix[r][c]<target)
left=mid+1;
else
right=mid;
}
return false;
}
};
leetcode 74: Search a 2D Matrix
最新推荐文章于 2019-12-08 21:14:49 发布