Leetcod-47_PermutationsII-全排列秒解-【C++】

47. Permutations II

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

For example,

[1,1,2]have the following unique permutations:

[
  [1,1,2],
  [1,2,1],
  [2,1,1]
]

class Solution {
public:
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        vector<vector<int> >ret;
        do{
            ret.push_back(nums);
        }
        while(next_permutation(nums.begin(),nums.end()));
        return ret;        
    }
};