90. Subsets II

解法一：普通的回溯

class Solution {
public:
    vector<vector<int>> permute(vector<int>& nums) {
        vector<vector<int>> result;
        if(nums.empty()) return result;
        vector<int> list;
        dfs(list, result, nums);
        return result;
    }
private:
    void dfs(vector<int>& list, vector<vector<int>>& result, vector<int> 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();
        }
    }
};