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
.
给出的是一个二维矩阵,用vector表示, 特点是行递增,列递增。解决这个问题很简单,把所有数字看成1维数组然后用二分查找做就好了 时间复杂度O(logn)。 m * n 表示元素总数。对于中间位置mid 根据 mid / n得到所在行号, 根据mid % n得到列号。
class Solution {
public:
bool searchMatrix(vector<vector<int> > &matrix, int target) {
// Note: The Solution object is instantiated only once and is reused by each test case.
if (matrix.size() == 0 || matrix[0].size() == 0) return false;
int m = matrix.size(), n = matrix[0].size();
int start = 0, end = m * n;
while (start < end)
{
int mid = (start + end) / 2;
int row = mid / n, col = mid % n;
if (matrix[row][col] == target)
return true;
else if (matrix[row][col] > target)
end = mid;
else
start = mid + 1;
}
return false;
}
};