题目:
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].
Solution:
直接运用nextPermutation的思想。nextPermutation,按照字典序排序的,字符串的下一个字典序全排列。
class Solution {
public:
void nextPermutation(vector<int>& nums)
{
int N = nums.size();
int i = N - 1;
while(i > 0 && (nums[i-1