491. 递增子序列

491. 递增子序列_第1张图片

class Solution {
public:
    vector>ans;
    vectorpath;
    void dfs(vector& nums,int star){
        if(path.size()>1){
            ans.push_back(path);
        }
        setst;
        for(int i=star;i> findSubsequences(vector& nums) {
        dfs(nums,0);
        return ans;
    }
};

你可能感兴趣的:(力扣刷题,回溯,数据结构,leetcode)