class Solution {
public:
bool searchArray(vector<vector<int>> array, int target) {
//从右上开始查找,大于目标数j++,小于i++;
if(array.empty() || array[0].empty()) return false;
int n = array.size(),m = array[0].size();
int i = 0,j = n - 1;
while(i < n && j >= 0){
if(target == array[i][j]) return true;
if(target < array[i][j]) j--;
else i++;
}
return false;
}
};