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].
题意:对一组数字进行全排(包含重复数字)
解题思路:基于Permutations ,对数字进行排序从小到大,对与当前交换位相同的数字相同的数,以及已经交换过的数字不进行交换。
void pu(vector<int> num,int n,vector<vector<int>>& vn)
{
if (n < num.size() - 1)
{
for (int i = n; i<num.size(); ++i)
{
if (i>n&&(num[i] == num[n]||num[i]==num[i-1])) //num[i] == num[n]与当前交换位相同的数字,num[i]==num[i-1]排序后连续相同的数字只交换一次即可。
{
continue;
}
vector<int> t = num;
int temp = t[i];
t[i] = t[n];
t[n] = temp;
sort(t.begin() + n + 1, t.end());//对交换后的序列需要继续进行交换的部分进行排序
pu(t, n + 1, vn);
}
}
else
{
vn.push_back(num);
}
}
vector<vector<int>> permuteUnique(vector<int>& nums) {
vector<vector<int>> ret;
sort(nums.begin(),nums.end());
pu(nums,0,ret);
return ret;
}