题目链接:https://www.acwing.com/problem/content/description/16/
题目如下:
class Solution {
public:
bool searchArray(vector<vector<int>> array, int target) {
int row=array.size();
if(row==0) return false;
int col=array[0].size();
int i=row-1,j=0;//从!!!左下角!!!开始向target检索,i行j列
while(i>=0&&j<col){
if(array[i][j]==target) return true;
else if(array[i][j]>target) --i;
else if(array[i][j]<target) ++j;
}
return false;
}
};