LeetCode 47 全排列 II

全排列 II

class Solution {
public:
    vector<vector<int>> result;
    void DFS(vector<int> nums,int i)
    {
        int len=nums.size();
        if(i==len-1)
        {
            result.push_back(nums);           
        }
        else
        {
            for(int k=i;k<len;++k)
        {
            if(k>i&&nums[k]==nums[i])
                continue;
            swap(nums[k],nums[i]);
            DFS(nums,i+1);            
        }                   
        } 
    }
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        DFS(nums,0);
        return result;
    }
};