编写一个高效的算法来搜索 m x n 矩阵 matrix 中的一个目标值 target 。该矩阵具有以下特性:
- 每行的元素从左到右升序排列。
- 每列的元素从上到下升序排列。
示例 1:
输入:matrix = [[1,4,7,11,15],[2,5,8,12,19],[3,6,9,16,22],[10,13,14,17,24],[18,21,23,26,30]], target = 5
输出:true
示例 2:
输入:matrix = [[1,4,7,11,15],[2,5,8,12,19],[3,6,9,16,22],[10,13,14,17,24],[18,21,23,26,30]], target = 20
输出:false
提示:
- m == matrix.length
- n == matrix[i].length
- 1 <= n, m <= 300
- -109 <= matrix[i][j] <= 109
- 每行的所有元素从左到右升序排列
- 每列的所有元素从上到下升序排列
- -109 <= target <= 109
顺序查找O(n^2)
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
for (size_t i = 0; i < matrix.size(); i++){
for (size_t j = 0; j < matrix[0].size(); j++) {
if (matrix[i][j]==target){
return true;
}
}
}
return false;
}
};
二分查找O(nlogn)
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
for (size_t i = 0; i < matrix.size(); i++){
bool ret = binary_search2(matrix[i], target);
if (ret) return ret;
}
return false;
}
private:
bool binary_search2(vector<int>& nums, int target) {
int left = 0;
int right = nums.size() - 1;
while (left <= right) {
int mid = (left + right) / 2;
if (nums[mid] > target) right = mid - 1;
else if (nums[mid] < target) left = mid + 1;
else return true;
}
return false;
}
};