具体思路:
之前做过,直接按递增顺序查找;
具体代码:
class Solution {
public:
bool findNumberIn2DArray(vector<vector<int>>& matrix, int target) {
if(matrix.size()==0||matrix[0].size()==0)
return false;
int n=matrix.size();
int m=matrix[0].size();
int row=0;
int col=m-1;
while(row<n&&col>=0){
if(matrix[row][col]==target)
return true;
if(matrix[row][col]>target){
col--;
}else{
row++;
}
}
return false;
}
};