491. Increasing Subsequences

最新推荐文章于 2020-04-07 22:29:34 发布

duoyasong5907

最新推荐文章于 2020-04-07 22:29:34 发布

阅读量169

点赞数

本文链接：https://blog.csdn.net/duoyasong5907/article/details/78956437

版权

dfs + set

class Solution {
public:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        vector<vector<int>> res;
        vector<int> cur;
        rev(nums, 0, res, cur);
        return res;
    }
    
    void rev(vector<int> &nums, int start, vector<vector<int>> &res, vector<int>& cur) {
        set<int> s;
        for(int i = start; i < nums.size(); i++) {
            if (cur.size() == 0 && s.find(nums[i]) == s.end()) {
                cur.push_back(nums[i]);
                rev(nums, i + 1,  res, cur);
                cur.pop_back();
                s.insert(nums[i]);
                continue;
            }   
            int last = cur[cur.size() - 1];
            if (nums[i] >= last && s.find(nums[i]) == s.end()) {         
                cur.push_back(nums[i]);
                res.push_back(cur);
                rev(nums, i + 1, res, cur);
                cur.pop_back();
                s.insert(nums[i]);
            }
        }
    }
};

感觉解法一般，回头再看看更优解