[leetcode] 组合总和

39. 组合总和 - 力扣（LeetCode）

i

class Solution {
    int aim;
    vector<vector<int>> ret;
    vector<int> path;
public:
    vector<vector<int>> combinationSum(vector<int>& nums, int target) {
        aim = target;
        dfs(nums, 0, 0);
        return ret;
    }

    void dfs(vector<int>& nums, int pos, int sum){
        if(aim == sum){
            ret.push_back(path);
            return;
        }

        if(sum > aim || pos == nums.size()) return;

        for(int i = pos; i < nums.size(); i++){
            path.push_back(nums[i]);
            dfs(nums, i, sum + nums[i]);
            path.pop_back();
        }
    }
};