[LeetCode] 39. Combination Sum

题目：

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

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

Note:

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

For example, given candidate set [2, 3, 6, 7] and target 7, 
A solution set is: 

[
  [7],
  [2, 2, 3]
]

思路

1.递归，缩写问题规模。

2.广度优先遍历，不断迭代target ，对每个小于target的值，进行广度遍历。

3.递归的用法，以往对递归的认识是从比较高的角度，看他解决问题的方式，但 还因注意 递归也是线性执行的，所以也可以运用相应的线性性质。比如：

            combination.push_back(candidates[i]);
            combinationSum(candidates,target - candidates[i],res,combination,i);
            combination.pop_back();

先 压入 ，然后递归后在 弹出。

Code

class Solution {

private:
    void combinationSum(vector<int> &candidates, int target , vector<vector<int>> &res,vector<int> &combination,int begin){
        if(!target){
            res.push_back(combination);
            return;
        }
        for(int i = begin;i != candidates.size() && target >= candidates[i];i++){
            combination.push_back(candidates[i]);
            combinationSum(candidates,target - candidates[i],res,combination,i);
            combination.pop_back();
        }
    }
    
    

    
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        vector<vector<int>> res;
        vector<int> combination;
        combinationSum(candidates,target,res,combination,0);
        return res;
    }
};