解题思路
从矩阵左下角开始走路,小于target向上走一步,大于target向右走一步
class Solution {
public:
//从矩阵左下角开始走路,小于target向上走一步,大于target向右走一步
bool findNumberIn2DArray(vector<vector<int>>& matrix, int target) {
int n = matrix.size(),m;
if(n>0){m = matrix[0].size();}else{return false;}
int i=n-1,j=0;
while(i>=0 && j<m){
if(matrix[i][j]==target){
return true;
}else if(matrix[i][j]>target){
i--;
}else if(matrix[i][j]<target){
j++;
}
}
return false;
}
};