行列排序矩阵查找

class Solution {
public:
bool Find(int target, vector<vector<int> > array) {
if(array.size()==0) return false;
if(array[0].size()==0) return false;
int m=array.size()-1;
int n=array[0].size()-1;
for(int i=0,j=n;i<=m&&j>=0;)
{
if(target>array[i][j]) ++i;
else if(target<array[i][j]) --j;
else return true;
}
return false;
}
};</int>