LEETCODE 全排列1

最新推荐文章于 2022-11-07 20:36:41 发布

sh308178685

最新推荐文章于 2022-11-07 20:36:41 发布

阅读量155

点赞数

分类专栏： C学习笔记

本文链接：https://blog.csdn.net/sh308178685/article/details/97764030

版权

C学习笔记专栏收录该内容

11 篇文章 0 订阅

订阅专栏

class Solution {
public:
    vector<vector<int>>res;
    vector<int>clist;
    unordered_set<int> _set;
    vector<vector<int>> permute(vector<int>& nums) {
        helper(nums);
        return res;
    }
    void helper(vector<int>& nums)
    {
        if(nums.size()  == clist.size())
        {
            res.push_back(clist);
            return;
        }
        
        for(int i = 0 ; i < nums.size();i++)
        {
            if(!_set.count(i))
            {
                clist.push_back(nums[i]);
                _set.insert(i);
                helper(nums);
                _set.erase(i);
                clist.erase( clist.begin() + clist.size() - 1  );
            }
        }
    }
};

方法2：

class Solution {
public:
    
    unordered_set<int>_set;
    vector<vector<int>> reslist;
    void func(int pos,vector<int>& nums,vector<int>& res)
    {
            for(int i = 0 ; i < nums.size() ; i++)
            {
                if(_set.count(nums[i]) == 0)
                {
                    res[pos] = nums[i];
                    _set.insert(nums[i]);
                }
                else
                {
                    continue;
                }
                
                if(pos < nums.size() - 1)
                {
                    func(pos+1,nums,res);
                }
                
                _set.erase(nums[i]);
                
                
                if(pos == nums.size() -1)
                {
                    reslist.push_back(res);
                }
            }
        
    }
    
    vector<vector<int>> permute(vector<int>& nums) {
        
        vector<int>res(nums.size());
        
        func(0,nums,res);
        
        return reslist;
    }
};