240. Search a 2D Matrix II
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] ]
Given target = 5
, return true
.
Given target = 20
, return false
.
分析:从矩阵的最右上角开始判断,如果目标数比当前的数小,那么它肯定不会在当前数所在的列,可以排除当前列;如果目标数比当前数大,那么它肯定不会在当前数所在的行,排除当前行。例子中的15,如果目标比15大,可以排除当前的行,如果比15小,可以排除当前列。
bool searchMatrix(vector<vector<int>>& matrix, int target) {
int m=matrix.size();
int n=matrix[0].size();
if(m<1||n<1) return false;
int col=n-1;
int row=0;
while(row<m && col>=0)
{
if(target==matrix[row][col])
return true;
else if(target>matrix[row][col])
row++;
else col--;
}
return false;
}
时间复杂度: O(n+m) //m, n是当前的行数和列数