*leetcode #47 in cpp

最新推荐文章于 2024-09-16 06:54:08 发布

xiaolienahu

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量167

点赞数

分类专栏： interview 文章标签： cpp leetcode

本文链接：https://blog.csdn.net/xiaolienahu/article/details/51527240

版权

interview 专栏收录该内容

135 篇文章 0 订阅

订阅专栏

The solution is very similar to the solution of $46. The only thing we should do is to avoid duplicates.

Analysis to avoid duplicates is almost the same as the one in #40.

Code:

class Solution {
public:
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<vector<int>> res;
        vector<int> members;
        find_permutation(members, nums, &res);
        return res;
        
    }
    
    void find_permutation(vector<int> member, vector<int> nums, vector<vector<int>> *res){
        if(nums.size() == 1){
            member.push_back(nums[0]);
            res->push_back(member);
            return;
        }
        if(nums[0] == nums[nums.size() - 1]){//when numbers all the same, stop generating permutation
            for(int i = 0; i < nums.size(); i ++)
                member.push_back(nums[i]);
            res->push_back(member);
            return;
        }
        for(int i = 0; i < nums.size(); i ++){
            if(i > 0 && nums[i] == nums[i-1]){//avoid duplicates. skipp duplicates numbers
                continue;
            }
            int temp = nums[i];
            member.push_back(temp);
            nums.erase(nums.begin() + i);
            find_permutation(member, nums, res);
            member.pop_back();
            nums.insert(nums.begin() + i, temp);
        }
    };
    
};