标签：
Problems:
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], and [2,1,1].
解法一：STL中的next_permutation
class Solution { public: vector<vector<int>> permuteUnique(vector<int>& nums) { vector<vector<int>> result; sort(nums.begin(),nums.end()); do{ result.push_back(nums); }while(next_permutation(nums.begin(),nums.end())); return result; } };
标签：
原文地址：http://www.cnblogs.com/xiaoying1245970347/p/4571721.html
