题解 | #二维数组中的查找#

#include <iostream>
#include <vector>
using namespace std;
class Solution {
  public:
    bool Find(int target, vector<vector<int>> array) {
        int r = array.size();
        int c = array[0].size();
        for (int i = r - 1, j = 0; (i >= 0) && ( j < c); ) {
            cout << i << "" << j << endl;
            if (target == array[i][j]) {
                return true;
            } else if (target > array[i][j]) {
                j++;
            } else {
                i--;
            }

        }
        return false;
    }
};