class Solution {
public:
bool searchArray(vector<vector<int>> array, int target) {
int n = array.size();
//判断是否为空数组
if(n == 0)
return false;
int m = array[0].size();
int i = 0, j = m - 1;
while(i < n && j >= 0){
if(array[i][j] == target)
return true;
//如果右上角的值比目标值大,将最后一列删掉
else if(array[i][j] > target)
j--;
//否则将一行删掉
else
i++;
}
return false;
}
};