leetcode 491. 递增子序列 c++（回溯 回看）2021-07-12

无法排序的同层去重

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backTracking(vector<int> &nums, int startIndex);
public:
    vector<vector<int>> findSubsequences(vector<int>& nums) 
    {
        vector<bool> used(nums.size());
        backTracking(nums, 0);
        return result;
    }
};

inline void Solution::backTracking(vector<int> &nums, int startIndex)
{
    if (path.size() > 1)
        result.push_back(path);
    
    unordered_set<int> uset; //同层去重
    for (int i = startIndex; i < nums.size(); ++i)
    {
        
        if (!path.empty() && path.back() > nums[i] || uset.find(nums[i]) != uset.end())
            continue;
        uset.insert(nums[i]);
        path.push_back(nums[i]);
        backTracking(nums, i + 1);
        path.pop_back();
        
    }
}