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]
]

由题意得，给定一个数组，和一个目标值，然后从数组中找和等于目标值的组合，而且每个数都可以重复使用。所以这一题也是比较典型的深搜，每种情况都要考虑，所以复杂度大概在O(n!)，需要考虑的是终止条件和剪枝条件，代码如下。

Code(LeetCode运行13ms):

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<vector<int>> result;
        vector<int> aSolution;
        sort(candidates.begin(), candidates.end());
        dfs(candidates, result, aSolution, target, 0);
        return result;
    }
    
    void dfs(vector<int>& candidates, vector<vector<int>>& result, vector<int>& aSolution, int target, int start) {
        if (target == 0) {
            result.push_back(aSolution);
            return;
        }
        for (int i = start; i < candidates.size(); i++) {
            if (target < candidates[i]) {
                return;
            }
            aSolution.push_back(candidates[i]);
            dfs(candidates, result, aSolution, target - candidates[i], i);
            aSolution.pop_back();
        }
    }
};