461-回溯算法（90.子集II、491. 递增子序列、46.全排列、47.全排列 II）

最新推荐文章于 2024-07-27 22:54:11 发布

liufeng2023

最新推荐文章于 2024-07-27 22:54:11 发布

阅读量122

点赞数

分类专栏：代码随想录刷题文章标签：算法 leetcode 职场和发展

本文链接：https://blog.csdn.net/edward_lf/article/details/125630430

版权

代码随想录刷题专栏收录该内容

33 篇文章 1 订阅

订阅专栏

90.子集II

在这里插入图片描述

class Solution {
private:
    vector<vector<int>> res;
    vector<int> path;
public:
    void backtracking(vector<int>& nums, int start_index)
    {
        res.push_back(path);
        unordered_set<int> uset;

        for (int i = start_index; i < nums.size(); i++)
        {
            if (uset.find(nums[i]) != uset.end())
            {
                continue;
            }
            uset.insert(nums[i]);

            path.push_back(nums[i]);
            backtracking(nums, i + 1);
            path.pop_back();
        }
    }

public:
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        res.clear();
        path.clear();
        sort(nums.begin(), nums.end());
        backtracking(nums, 0);
        return res;
    }
};

在这里插入图片描述

491. 递增子序列

在这里插入图片描述

子序列不能改变原数组顺序！

class Solution {
private:
    vector<vector<int>> res;
    vector<int> path;

    void backtracking(vector<int>& nums, int start_index)
    {
        if (path.size() > 1)
        {
            res.push_back(path);
        }

        unordered_set<int> st;
        for (int i = start_index; i < nums.size(); i++)
        {
            if ((!path.empty() && nums[i] < path.back()) || st.find(nums[i]) != st.end())
            {
                continue;
            }

            st.insert(nums[i]);
            path.push_back(nums[i]);
            backtracking(nums, i + 1);
            path.pop_back();
        }
    }


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

在这里插入图片描述

46.全排列

在这里插入图片描述

class Solution {
private:
    vector<vector<int>> res;
    vector<int> path;

    void backtracking(vector<int>& nums, vector<bool>& used)
    {
        if (path.size() == nums.size())
        {
            res.push_back(path);
        }

        for (int i = 0; i < nums.size(); i++)
        {
            if (used[i] == true) continue;

            used[i] = true;
            path.push_back(nums[i]);
            backtracking(nums, used);
            path.pop_back();
            used[i] = false;
        }
    }

public:
    vector<vector<int>> permute(vector<int>& nums) {
        res.clear();
        path.clear();
        vector<bool> used(nums.size(), false);
        backtracking(nums, used);
        return res;
    }
};

在这里插入图片描述

47.全排列 II

在这里插入图片描述

class Solution {
private:
    vector<vector<int>> res;
    vector<int> path;

    void backtracking(vector<int>& nums, vector<bool>& used)
    {
        if (path.size() == nums.size())
        {
            res.push_back(path);
        }

        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)
            {
                used[i] = true;
                path.push_back(nums[i]);
                backtracking(nums, used);
                path.pop_back();
                used[i] = false;
            }
        }
    }

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