时间限制:1秒 空间限制:32768K 热度指数:881556
本题知识点: 查找
题目描述
在一个二维数组中(每个一维数组的长度相同),每一行都按照从左到右递增的顺序排序,每一列都按照从上到下递增的顺序排序。请完成一个函数,输入这样的一个二维数组和一个整数,判断数组中是否含有该整数。
Point1:Arrays are incremented from left to right and from top to bottom. The best solution is to start from the point in the lower left corner, go up is decreasing, go right is increasing, each time only one way.
Time complexity:O(m+n)
class Solution {
public:
bool Find(int target, vector<vector<int> > array) {
int row=array.size();
int col=array[0].size();
int i=row-1,j=0;
while(i>=0&&j<col){
if(array[i][j]==target)return true;
if(array[i][j]<target){
j++;
continue;
}
if(array[i][j]>target){
i--;
continue;
}
}
return false;
}
};
Point2: binary search
class Solution {
public:
bool Find(int target, vector<vector<int> > array) {
int row=array.size();
int col=array[0].size();
int i=0;
while(i<row){
int collef=0,colrig=col-1,colmid;
while(collef<=colrig){
int colmid=(collef+colrig)/2;
int t=array[i][colmid];
if(t==target)return true;
if(t<target)collef=colmid+1;
if(t>target)colrig=colmid-1;
}
i++;
}
return false;
}
};