题目描述:
Write an efficient algorithm that searches for a value in an m x 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.
For example,
Consider the following matrix:
[ [1, 3, 5, 7], [10, 11, 16, 20], [23, 30, 34, 50] ]
Given target = 3
, return true
.
Searching a 2D Sorted Matrix Part I还没有细看,先留着。
代码1(二分):
class Solution {
public:
bool searchMatrix(vector<vector<int> > &matrix, int target) {
int l(0), r(matrix.size() - 1);
while (l < r){
int mid = l + (r - l) / 2;
if (target == matrix[mid][0])
return true;
if (target>matrix[mid][0] && target<matrix[mid + 1][0]){
l = mid;
break;
}
if (target > matrix[mid][0])
l = mid + 1;
else
r = mid - 1;
}
vector<int> row = matrix[l];
l = 0;
r = row.size() - 1;
while (l <= r){
int mid = l + (r - l) / 2;
if (target == row[mid])
return true;
if (target > row[mid])
l = mid + 1;
else
r = mid - 1;
}
return false;
}
};
代码2:
class Solution {
public:
bool searchMatrix(vector<vector<int> > &matrix, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int i = 0, j = matrix[0].size() - 1;
while (i < matrix.size() && j >= 0)
{
if (target == matrix[i][j])
return true;
else if (target < matrix[i][j])
j--;
else
i++;
}
return false;
}
};