47. Permutations II

class Solution {
public:
    vector<vector<int>> permuteUnique(vector<int>& nums) {
        vector<vector<int>> result;
        if(nums.size() == 0) return result;
        vector<int> list;
        vector<bool> used(nums.size(), false);
        sort(nums.begin(), nums.end());
        permuteUniqueHelper(result, list, used, nums);
        return result;
    }
private:
    void permuteUniqueHelper(vector<vector<int>>& result, vector<int>& list, vector<bool>& used, vector<int> nums){
        if(list.size() == nums.size()){
            result.push_back(list);
            return;
        }
        for(int i = 0; i < nums.size(); i++){
            if(used[i] || (i != 0 && nums[i] == nums[i-1] && used[i-1] == false)){
                continue;
            }
            used[i] = true;
            list.push_back(nums[i]);
            permuteUniqueHelper(result, list, used, nums);
            list.pop_back();
            used[i] = false;
        }
    }
};