491. 递增子序列

491. 递增子序列

class Solution {
public:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        set<vector<int>> res;
        vector<int> rp;
        help(0,nums,rp,res);
        return vector<vector<int>>(res.begin(),res.end());
    }
    void help(int k,vector<int> &nums,vector<int> &rp,set<vector<int>> &res){
        for(size_t i=k;i<nums.size();++i){
            if(rp.empty()||rp.back()<=nums[i]){
                rp.push_back(nums[i]);
                if(rp.size()>1) res.insert(rp);
                help(i+1,nums,rp,res);
                rp.pop_back();
            }
        }
    }
};