从零开始的LC刷题(131): Permutations II

最新推荐文章于 2022-07-18 19:27:19 发布

クロネコ黒猫

最新推荐文章于 2022-07-18 19:27:19 发布

阅读量91

点赞数

分类专栏： LEETCODE C++ 文章标签： lc

本文链接：https://blog.csdn.net/cyr429/article/details/102979498

版权

LEETCODE C++ 专栏收录该内容

134 篇文章 1 订阅

订阅专栏

原题：

Given a collection of numbers that might contain duplicates, return all possible unique permutations.

Example:
Input: [1,1,2]
Output:
[
  [1,1,2],
  [1,2,1],
  [2,1,1]
]

给出有重复数字的数列的全排列，在上一题基础上改一下就行，结果：

Success

Runtime: 20 ms, faster than 95.64% of C++ online submissions for Permutations II.

Memory Usage: 10.4 MB, less than 52.38% of C++ online submissions for Permutations II.

代码：

class Solution {
public:
    vector<vector<int>> re;
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        vector<bool> dict(nums.size(),0);
        vector<int> init;
        getp(nums,init,dict,nums.size());
        return re;
    }
    void getp(vector<int>& original,vector<int>& cur,vector<bool>& dict,int remain){
        if(!remain){re.push_back(cur);return;}
        for(int i=0;i<original.size();i++){
            if(i!=original.size()-1&&original[i]==original[i+1]&&dict[i+1]==0){continue;}
            if(!dict[i]){
                cur.push_back(original[i]);
                dict[i]=1;
                getp(original,cur,dict,remain-1);
                dict[i]=0;
                cur.pop_back();
                }
        }
        
        
    }
};