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 in ascending from left to right.
- Integers in each column are sorted in ascending from top to bottom.
For example,
Consider the following 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]解析:原题已给出矩阵的特点,每一行,每一列元素都是递增的。因此可以根据这个特点给出高效的算法,将第一行最后一个元素和目标数字相比,如果大,则往左移动,如果小,则往下移动,通过while循环,可以将答案给出。如果用传统的两个for循环的话,时间复杂度为O(m*n),而用这个方法可以把时间降到O(m+n)。
源代码如下:
class Solution {
public:
bool searchMatrix(vector<vector<int>>& matrix, int target) {
int row=matrix.size();
if(row==0) return false;
int col=matrix[0].size();
int i=0;
int j=col-1;
while(i<row&&j>=0)
{
if(matrix[i][j]==target)
return true;
if(matrix[i][j]>target)
j--;
if(matrix[i][j]<target)
i++;
}
return false;
}
};