【代码随想录算法训练营第37期第二十九天 | LeetCode491.递增子序列、46.全排列、47.全排列 II】-CSDN博客

本文链接：https://blog.csdn.net/cattte/article/details/139455421

代码随想录算法训练营第37期第二十九天 | LeetCode491.递增子序列、46.全排列、47.全排列 II

一、491.递增子序列

解题代码C++：

class Solution {
public:
    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())
                continue;
                
            uset.insert(nums[i]);
            path.push_back(nums[i]);
            backtracking(nums, i + 1);
            path.pop_back();
        }
    }

    vector<vector<int>> findSubsequences(vector<int>& nums) {
        result.clear();
        path.clear();
        backtracking(nums, 0);
        return result;
    }
};

题目链接/文章讲解/视频讲解：
https://programmercarl.com/0491.%E9%80%92%E5%A2%9E%E5%AD%90%E5%BA%8F%E5%88%97.html

二、46.全排列

解题代码C++：

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;
    vector<bool> used;
    void backtracking(vector<int>& nums, int k, vector<bool>&used)
    {
        if(k == nums.size())
        {
            result.push_back(path);
            return;
        }

        for(int i = 0; i < nums.size(); i ++)
            if(!used[i])
            {
                used[i] = true;
                path.push_back(nums[i]);
                backtracking(nums, k + 1, used);
                path.pop_back();
                used[i] = false;
            }
    }
    vector<vector<int>> permute(vector<int>& nums) {
        result.clear();
        path.clear();
        vector<bool> used(nums.size(), false);
        backtracking(nums, 0, used);
        return result;
    }
};

题目链接/文章讲解/视频讲解：
https://programmercarl.com/0046.%E5%85%A8%E6%8E%92%E5%88%97.html

三、47.全排列 II

解题代码C++：

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking(vector<int>& nums, int k, vector<bool>& used)
    {
        if(k == 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])
            {
                path.push_back(nums[i]);
                used[i] = true;
                backtracking(nums, k + 1, used);
                path.pop_back();
                used[i] = false;
            }
        }
    }

    vector<vector<int>> permuteUnique(vector<int>& nums) {
        result.clear();
        path.clear();
        sort(nums.begin(), nums.end());
        vector<bool> used(nums.size(), false);
        backtracking(nums, 0, used);
        return result;
    }
};