LeetCode-047 Permutations II

Description

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

Example

Input: [1,1,2]
Output:
[
[1,1,2],
[1,2,1],
[2,1,1]
]

Analyse

就是上道题出现了重复数字的情况，但是并没有什么区别（抱歉，代码适用性强真的为所欲为的）

Code

class Solution {
public:
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        vector<vector<int>> ans;
        vector<int> origin = nums;
        ans.push_back(origin);
        nextPermutation(nums);
        while (origin != nums) {
            ans.push_back(nums);
            nextPermutation(nums);
        }
        return ans;
    }
    void nextPermutation(vector<int>& nums) {
        if (nums.size() == 0) return;
        int i = nums.size() - 2, j;
        while(i >= 0 && nums[i] >= nums[i + 1]) i--;
        if(i >= 0) {  
            j = i + 1;  
            while(j < nums.size() && nums[j] > nums[i]) j++;  
            j--;
            swap(nums[i], nums[j]);
        }
		i++; j = nums.size() - 1;
		while (i < j) {
			swap(nums[i], nums[j]);
			i++; j--;
		}
	}
};