90. Subsets II

image.png

解法一：普通的回溯

class Solution {
public:
    vector> permute(vector& nums) {
        vector> result;
        if(nums.empty()) return result;
        vector list;
        dfs(list, result, nums);
        return result;
    }
private:
    void dfs(vector& list, vector>& result, vector nums){
        if(list.size() == nums.size()){
            result.push_back(list);
            return;
        }
        for(int i = 0; i < nums.size(); i++){
            if(find(list.begin(), list.end(), nums[i]) != list.end()){
                continue;
            }
            list.push_back(nums[i]);
            dfs(list, result, nums);
            list.pop_back();
        }
    }
};