Permutations II

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:

class Solution {
public:
    void dfs(vector<vector<int>> &res, vector<int> &p, vector<int> &nums)
    {
        if(nums.size() == 0)
        {
            res.push_back(p);
            return ;
        }
        for(int i = 0; i < nums.size(); )
        {
            int index = nums[i];
            int next = i + 1;
            while(next < nums.size() && nums[next] == index) next++;
            p.push_back(index);
            nums.erase(nums.begin() + i);
            dfs(res, p, nums);
            nums.insert(nums.begin() + i, index);
            p.pop_back();
            i = next;
        }
    }
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        sort(nums.begin(), nums.end());
        vector<vector<int>> res;
        vector<int> p;
        dfs(res, p, nums);

        return res;
    }
};