代码随想录 | 回溯4

嘤!

已于 2024-09-11 15:44:55 修改

阅读量108

点赞数 1

文章标签：算法

于 2024-09-11 13:56:47 首次发布

本文链接：https://blog.csdn.net/qq_45025036/article/details/142138091

版权

491.递增子序列

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;
    void track(vector<int>& nums,int startindex )
    {
        if(path.size()>=2)
        {
            result.push_back(path);
        }
        unordered_set<int> uset; // 使用set对本层元素进行去重
        for(int i=startindex;i<nums.size();i++)
        {
            if((!path.empty() && path.back()>nums[i]) || uset.find(nums[i])!=uset.end())
            {
                continue;
            }
            uset.insert(nums[i]);
            path.push_back(nums[i]);
            track(nums,i+1);
            path.pop_back();

        }
    }

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

46.全排列

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

    }
    vector<vector<int>> permute(vector<int>& nums) {
        vector<bool> used(nums.size(),false);
        track(nums,used);
        return result;
    }
};

47.全排列 II

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;
    void track(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;
                track(nums,used);
                used[i] = false;
                path.pop_back();
            }
        
        }

    }

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