题解 | 二维数组中的查找

class Solution {
  public:
    bool Find(int target, vector<vector<int> >& array) {
        set<int>st;
        for (int i = 0; i < array.size(); ++i) {
            int l = 0;
            int r = array[i].size() - 1;
            if (array[i].size() == 0)
                return false;
            while (l < r) {
                int mid = (l + r) / 2;
                if (array[i][mid] >= target)
                    r = mid;
                else
                    l = mid + 1;
            }
            if (array[i][l] == target)
                return true;
        }
        return false;
    }
};