代码随想录算法训练营day25

半勺鸡腿堡

于 2024-09-02 10:34:24 发布

阅读量124

点赞数 3

文章标签：算法

本文链接：https://blog.csdn.net/qq_56445436/article/details/141813679

版权

1.递增子序列

1.1 题目

. - 力扣（LeetCode）

1.2 题解

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;
    vector<vector<int>> findSubsequences(vector<int>& nums)
    {


        result.clear();
        path.clear();
        backtracking(nums, 0);
        return result;
    }
    void backtracking(vector<int>& nums,int startindex)
    {
        //终止条件
        if (path.size() >= 2)
        {
            result.push_back(path);
        }
        if (startindex == nums.size())return;

        //单层递归逻辑
        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();
            

        }
    }
};

2.全排列

2.1 题目

. - 力扣（LeetCode）

2.2 题解

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;
    vector<vector<int>> permute(vector<int>& nums) 
    {
        vector<int> used(nums.size(), 0);
        result.clear();
        path.clear();
        backtracking(nums,used);
        return result;
    }
    void backtracking(vector<int>& nums,vector<int>& used)
    {
        //终止条件
        if (path.size() == nums.size())
        {
            result.push_back(path);
            return;
        }

        //单层递归逻辑
        for (int i = 0; i < nums.size(); i++)
        {
            if (used[i] == 1)continue;
            path.push_back(nums[i]);
            used[i]=1;
            backtracking(nums,used);
            path.pop_back();
            used[i]=0;
        }
    }
};

3.全排列II

3.1 题目

. - 力扣（LeetCode）

3.2 题解

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;
    vector<vector<int>> permuteUnique(vector<int>& nums) 
    {
        result.clear();
        path.clear();
        vector<int> used(nums.size(), 0);
        backtracking(nums, used);
        return result;
    }
    void backtracking(vector<int>& nums, vector<int>& used)
    {
        if (path.size() == nums.size())
        {
            result.push_back(path);
            return;
        }
        unordered_set<int> uset;
        for (int i = 0; i < nums.size(); i++)
        {
            if (used[i] == 1||uset.find(nums[i])!=uset.end())continue;
            uset.insert(nums[i]);
            path.push_back(nums[i]);
            used[i] = 1;
            backtracking(nums, used);
            path.pop_back();
            used[i] = 0;

        }
    }
};