#16 Permutations II

题目描述:

Given a list of numbers with duplicate number in it. Find all uniquepermutations.

Example

For numbers [1,2,2] the unique permutations are:

[
  [1,2,2],
  [2,1,2],
  [2,2,1]
]
题目思路:

这题和#15差不多。为了避免重复的情况,增加一个set去记录已经写入答案中的vector就好了。

Mycode(AC = 290ms):

class Solution {
public:
    /**
     * @param nums: A list of integers.
     * @return: A list of unique permutations.
     */
    vector<vector<int> > permuteUnique(vector<int> &nums) {
        // write your code here
        vector<vector<int>> ans;
        if (nums.size() == 0) return ans;
        
        vector<int> sofar;
        unordered_set<int> visited;
        set<vector<int>> answered;
        permute(ans, sofar, nums, visited, answered);
        return ans;
    }
    
    void permute(vector<vector<int>>& ans,
                 vector<int>& sofar,
                 vector<int>& nums,
                 unordered_set<int>& visited,
                 set<vector<int>>& answered)
    {
        if (sofar.size() == nums.size()) {
            if (answered.find(sofar) == answered.end()) {
                answered.insert(sofar);
                ans.push_back(sofar);
            }
            return;
        }
        
        for (int i = 0; i < nums.size(); i++) {
            if (visited.find(i) == visited.end()) {
                sofar.push_back(nums[i]);
                visited.insert(i);

                permute(ans, sofar, nums, visited, answered);
                
                sofar.pop_back();
                visited.erase(i);
            }
        }
    }
};


阅读更多
版权声明:三千微尘里,吾宁爱与憎 https://blog.csdn.net/haifischxia/article/details/52368357
文章标签: lintcode recursion
个人分类: lintcode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

#16 Permutations II

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭