代码随想录day29|| 491.递增子序列 46.全排列 47.全排列 II

. - 力扣（LeetCode）

回溯算法精讲，树层去重与树枝去重 | LeetCode：491.递增子序列_哔哩哔哩_bilibili

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking(vector<int>& nums,int startindex)
    {
        if(path.size()>=2)
        result.push_back(path);
        unordered_set<int> uset;
        for(int i=startindex;i<nums.size();i++)
        {
            if((!path.empty()&&nums[i]<path.back())||uset.find(nums[i])!=uset.end())||一种情况是选的元素不能小于路径里的最后一个元素，2、不能选重复的元素
            continue;
            uset.insert(nums[i]);
            path.push_back(nums[i]);
            backtracking(nums,i+1);
            path.pop_back();
        }
    }
public:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
    backtracking(nums,0);
    return result;
    }
};

class Solution {
private:
    vector<int>path;
    vector<vector<int>> result;
    void backtracking(vector<int>& nums,vector<bool>& used)
    {
        if(path.size()==nums.size())
        {
            result.push_back(path);
            return;
        }
        for(int i=0;i<nums.size();i++)
        {
            if(used[i]==true)
            continue;
            path.push_back(nums[i]);
            used[i]=true;
            backtracking(nums,used);
            path.pop_back();
            used[i]=false;
        }
    }
public:
    vector<vector<int>> permute(vector<int>& nums) {
        vector<bool> used(nums.size(),false);
     backtracking(nums,used);
     return result;
    }
};

 

 47. 全排列 II - 力扣（LeetCode）

回溯算法求解全排列，如何去重？| LeetCode：47.全排列 II_哔哩哔哩_bilibili

class Solution {
private:
    vector<int> path;
    vector<vector<int>> result;
    void backtracking(vector<int>& nums,vector<bool>& used)
    {
        if(path.size()==nums.size())
        {
            result.push_back(path);
            return;
        }
        for(int i=0;i<nums.size();i++)
        {
            if(i>0 && nums[i]==nums[i-1]&&used[i-1]==false)
            continue;
            if(used[i]==false)
           {
                path.push_back(nums[i]);
            used[i]=true;
            backtracking(nums,used);
            path.pop_back();
            used[i]=false;
           }
        }
    }
public:
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        vector<bool> used(nums.size(),false);
      sort(nums.begin(),nums.end());
      backtracking(nums,used);
      return result;
    }
};