LeetCode 74. 搜索二维矩阵
原题链接
中等
作者:
MeowRain
,
2024-01-10 14:32:31
,
所有人可见
,
阅读 43
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
int m = matrix.size();
int n = matrix[0].size();
int left = 0;
int right = m*n - 1;
while(left <= right) {
int mid = left + (right - left) / 2;
if(get(matrix,mid) == target) {
return true;
}else if(get(matrix,mid) > target){
right = mid - 1;
}else if(get(matrix,mid) < target) {
left = mid + 1;
}
}
return false;
}
int get(vector<vector<int>>&matrix,int index) {
int m = matrix.size();
int n = matrix[0].size();
int i = index / n;
int j = index%n;
return matrix[i][j];
}
};