题解 | #二维数组中的查找#
二维数组中的查找
https://www.nowcoder.com/practice/abc3fe2ce8e146608e868a70efebf62e
class Solution { public: bool Find(int target, vector<vector<int> > array) { int n = array.size(), m = array[0].size(); for(int i = n - 1, j = 0;i >= 0 && j < m;) { if(array[i][j] == target) return true; array[i][j] > target ? i-- : j++; } return false; } };