39. Combination Sum

题目描述

Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

The same repeated number may be chosen from candidates unlimited number of times.

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.

解题思路

像这种结果要求返回所有符合要求解的题十有八九都是要利用到递归，而且解题的思路都大同小异（看了别的博主的）
还是搞不懂递归的我：
来解释以下大佬的程序：

1. 我们create a function combinationSumDFS to finish the recursive procedure.
2. In this function we holds 3 variables: candidates, target, start(current candidate), out(current candidate set), and res(the final output result)
3. Each time we want to find out: The combination set that can satisfy target-start.
4. If target==0, then we can push back current candidates set to result.
5. Else if target<0, imply that there are no candidates set can satisfy current candidate, so we return an empty array.
6. If target>0, we recursively finding the next candidates set.

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<vector<int>> res;
        vector<int> out;
        combination(candidates, target, 0, out, res);
        return res;
    }
    void combination(vector<int>& candidates, int target, int start, vector<int>& out, vector<vector<int>>& res)
    {
        if(target<0) return;
        if(target==0) {res.push_back(out);return;}
        for(int i=start;i<candidates.size();i++)
        {
            out.push_back(candidates[i]);
            combination(candidates, target-candidates[i], i, out, res);
            out.pop_back();
        }
    }
    
};