牛客网-《剑指offer》-二维数组中的查找

class Solution {
public:
bool Find(vector<vector<int> > array,int target) {
int rows = array.size();
int cols = array[0].size();
int x = cols - 1;
int y = 0;
while ( x >= 0 && y < rows ) {
if (array[x][y] == target) return true;
if (array[x][y] < target) y++;
if (array[x][y] > target) x--;
}
return false;
}
};