【算法/回溯算法/子集问题】题解+详细备注（共2题）

78.子集

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;

    void backtracking(vector<int> &nums,int startIndex){
        result.push_back(path); // 收集子集要放在终止条件前(重点)
        if(startIndex >= nums.size()){
            return;
        }

        for(int i = startIndex;i<nums.size();++i){
            path.push_back(nums[i]);
            backtracking(nums,i+1);
            path.pop_back();
        }
    }

    vector<vector<int>> subsets(vector<int>& nums) {
        backtracking(nums,0);

        return result;
    }
};

90.子集II

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;
	// 同一树层的去重问题，与40.组合总和II树层去重一致
    void backtracking(vector<int> &nums,int startIndex,vector<bool> &used){
        result.push_back(path);

        if(startIndex >= nums.size()){
            return;
        }

        for(int i = startIndex;i<nums.size();++i){
            if(i>0&&nums[i] == nums[i-1] && used[i-1] == false){
                continue;
            }
            path.push_back(nums[i]);
            used[i] = true;
            backtracking(nums,i+1,used);
            used[i] = false;    
            path.pop_back();
        }
    }

    // 要对同一树层去重
    vector<vector<int>> subsetsWithDup(vector<int>& nums) {
        vector<bool> used(nums.size(),false);
		// 同一树层去重一定要先进行排序
        sort(nums.begin(),nums.end());
        backtracking(nums,0,used);

        return result;
    }
};