47. 全排列 II

class Solution {
public:
    vector>ans;
    vectorpath;
    set >st;
    void dfs(vector& nums,vector&used ){
        if(path.size()==nums.size()){
            if(!st.count(path)){
                ans.push_back(path);
                st.insert(path);
            }
        }
        for(int i=0;i> permuteUnique(vector& nums) {
        vectorused(nums.size(),false);
        dfs(nums,used);
        return ans;
    }
};