地址:https://leetcode.com/problems/search-a-2d-matrix/
题目:
Write an efficient algorithm that searches for a value in an m m m x n n 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:
Example 2:
理解:
二维数组的查找。想到的方法就是把他当一维数组。
实现1:
这个是我自己的实现。
复杂度应该是
O
(
l
o
g
(
m
n
)
)
O(log(mn))
O(log(mn))
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if (matrix.empty() || matrix[0].empty()) return false;
int lo = 0, hi = matrix.size()*matrix[0].size() - 1;
while (lo <= hi) {
int mid = lo + (hi - lo) / 2;
int i = mid / matrix[0].size();
int j=mid % matrix[0].size();
if (matrix[i][j] == target)
return true;
if (matrix[i][j] < target)
lo = mid + 1;
else
hi = mid - 1;
}
return false;
}
};
提交竟然用了16ms
实现2:
可以真正的二维搜索,先找一行,使得本行首小于target而下一行首大于target。然后再在这行里面查找。
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
if (matrix.empty() || matrix[0].empty()) return false;
int lo = 0, hi = matrix.size() - 1;
// 查找第一个大于target的元素
//hi永远指向满足要求的最小的元素,如果hi都不满足,则不存在。
while (lo < hi) {
int mid = lo + (hi - lo) / 2;
if (matrix[mid][0] <= target)
lo = mid + 1;
else
hi = mid;
}
int row = matrix[hi][0] > target ? hi - 1 : hi;
if (row<0) return false;
lo = 0, hi = matrix[0].size() - 1;
while (lo <= hi) {
int mid = lo + ((hi - lo) >> 1);
if (matrix[row][mid] == target)
return true;
else if (matrix[row][mid] < target)
lo = mid + 1;
else
hi = mid - 1;
}
return false;
}
};
啊二分查找真的是坑。。。坑死了,等假期总结一下吧。