代码随想录D29

最新推荐文章于 2024-09-27 11:50:10 发布

qq_21609915

最新推荐文章于 2024-09-27 11:50:10 发布

阅读量245

点赞数 2

文章标签：算法

本文链接：https://blog.csdn.net/qq_21609915/article/details/138434107

版权

491.递增子序列

代码随想录

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

class Solution {
private:
    vector<vector<int>> result;
    vector<int> set;
public:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        backtracking(nums, 0);
        return result;
    }

    void backtracking(const vector<int>& nums, int index){
        if(set.size() >= 2){
            result.push_back(set);
        }
        
        unordered_set<int> used;
        for(int i = index; i < nums.size(); i++){
            if((set.empty() || nums[i] >= set.back()) && used.find(nums[i]) == used.end()){
                set.push_back(nums[i]);
                used.insert(nums[i]);
                backtracking(nums, i + 1);
                set.pop_back();
            }
        }
    }
};

46.全排列

https://programmercarl.com/0046.%E5%85%A8%E6%8E%92%E5%88%97.html

视频讲解：https://www.bilibili.com/video/BV19v4y1S79W

class Solution {
private:
    vector<vector<int>> result;
    vector<int> set;
public:
    vector<vector<int>> permute(vector<int>& nums){
        vector<bool> used(nums.size());
        for(bool b : used){
            b = false;
        }
        backtracking(nums, used);
        return result;
    }

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

        for(int i = 0; i < nums.size(); i++){
            if(used[i] == false){
                set.push_back(nums[i]);
                used[i] = true;
                backtracking(nums, used);
                set.pop_back();
                used[i] = false;
            }
        }
    }
};

47.全排列 II

代码随想录

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

class Solution {
private:
    vector<vector<int>> result;
    vector<int> set;
    vector<bool> used;
public:
    vector<vector<int>> permuteUnique(vector<int>& nums){
       used.resize(nums.size());
        for(bool b : used){
            b = false;
        }
        sort(nums.begin(), nums.end());
        backtracking(nums);
        return result;
    }

    void backtracking(vector<int>& nums){
        if(set.size() == nums.size()){
            result.push_back(set);
            return;
        }

        for(int i = 0; i < nums.size(); i++){
            if(i > 0 && used[i - 1] == false && nums[i] == nums[i - 1]){
                continue;
            }
            if(used[i] == false){
                set.push_back(nums[i]);
                used[i] = true;
                backtracking(nums);
                set.pop_back();
                used[i] = false;
            }
        }
    }
};