class Solution {
public:
bool searchArray(vector<vector<int>> array, int target) {
if (array.empty() || array[0].empty()) return false;
int i = 0, j = array[0].size() - 1, n = array.size();
// 这里不要忘记 j >= 0 否则就会越界
while(i < n && j >= 0) {
// cout << array[i][j] << endl;
if (array[i][j] == target) return true;
if (array[i][j] > target) j--;
else i++;
}
return false;
}
};