递归
class Solution {
public:
int row=0,col=0;
bool dfs(vector<vector<int>>& matrix, int target,int i,int j){
// cout<<i<<" "<<j<<endl;
if(matrix[i][j]==target)return 1;
else if(matrix[i][j]>target&&j-1>=0){
if(dfs(matrix,target,i,j-1))return 1;
}else if(matrix[i][j]<target&&i+1<row){
if(dfs(matrix,target,i+1,j))return 1;
}
return 0;
}
bool searchMatrix(vector<vector<int>>& matrix, int target) {
row=matrix.size();
col=matrix[0].size();
return dfs(matrix,target,0,col-1);
}
};