题目描述:
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
1.Integers in each row are sorted in ascending from left to right.
2.Integers in each column are sorted in ascending from top to bottom.
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.
最简单的做法:for循环遍历
bool searchMatrix(vector<vector<int> >& matrix, int target)
{
for(int i=0;i<matrix.size();i++)
{
for(int j=0;j<matrix[i].size();j++)
{
if(matrix[i][j]==target)
return true;
}
}
return false;
}
思路:这个题关键是要看到左下角和右上角这两个点的特殊性,以左下角为例,向上走数变小,向右走数变大,如果目标数大于该点就往左搜索,如果目标数小与该点就往上搜索,直到搜索到目标数或者超出矩阵范围。
#include<cstdio>
#include<vector>
using namespace std;
bool searchMatrix(vector<vector<int> >& matrix, int target)
{
if(matrix.size()==0||matrix[0].size()==0)
return false;
if(matrix[0][0]>target||matrix[matrix.size()-1][matrix[0].size()-1]<target)
return false;
int X = matrix.size()-1;
int Y = 0;
while(X>=0&&Y<matrix[0].size())
{
if(matrix[X][Y]>target)
X--;
else
if(matrix[X][Y]<target)
Y++;
else
return true;
}
return false;
}
int main(){
int target = 20;
vector<vector<int> > matrix;
int a[5] = {1,4,7,11,15};
vector<int> line1(a,a+5);
int b[5] = {2,5,8,12,19};
vector<int> line2(b,b+5);
int c[5] = {3,6,9,16,22};
vector<int> line3(c,c+5);
int d[5] = {10,13,14,17,24};
vector<int> line4(d,d+5);
int e[5] = {18,21,23,26,30};
vector<int> line5(e,e+5);
matrix.push_back(line1);
matrix.push_back(line2);
matrix.push_back(line3);
matrix.push_back(line4);
matrix.push_back(line5);
printf("%d\n",searchMatrix(matrix,target));
return 0;
}