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
.
bool searchMatrix(vector<vector<int> > &matrix, int target) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int row = matrix.size();
int col = matrix[0].size()-1;
int begin = 0, end = row-1;
int mid;
while(begin < end)
{
mid = (begin + end)/2;
if(matrix[mid][col] == target) return true;
else if(matrix[mid][col] > target) end = mid;
else
begin = mid + 1;
}
row = begin;
begin = 0; end = matrix[row].size()-1;
while(begin < end)
{
mid = (begin + end)/2;
if(matrix[row][mid] == target) return true;
else if(matrix[row][mid] < target) begin = mid+1;
else end = mid-1;
}
if(matrix[row][begin] == target)return true;
return false;
}