Combination Sum

来源：Leetcode Algorithm ProblemSet 39

题目描述：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]
]

[cpp]  view plain  copy

1. class Solution {  
2. public:  
3.     vector<vector<int>> combinationSum(vector<int>& candidates, int target) {  
4.     }  
5. };  

解题思路：这是从题目的讨论中看到的方法，循环遍历，如[2, 3, 6, 7]，当i为0，放入一个2进入combination，再继续在[2, 3, 6, 7]里选择；当i为1时，则不再有2，只在[3, 6, 7]里选择，最终可以涵盖所有情况。

题解代码：

[cpp]  view plain  copy

1. class Solution {  
2. public:  
3.     vector<vector<int>> combinationSum(vector<int>& candidates, int target) {  
4.         sort(candidates.begin(), candidates.end());  
5.         vector<vector<int> > res;  
6.         vector<int> combination;  
7.         combinationSum(candidates, target, res, combination, 0);  
8.         return res;  
9.     }  
10.     void combinationSum(vector<int> &candidates, int target, vector<vector<int> > &res, vector<int> &combination, int head) {  
11.         if (target == 0) {  
12.             res.push_back(combination);  
13.             return;  
14.         }  
15.         for (int i = head; i < candidates.size() && candidates[i] <= target; i++) {  
16.             combination.push_back(candidates[i]);  
17.             combinationSum(candidates, target - candidates[i], res, combination, i);  
18.             combination.pop_back();  
19.         }  
20.     }  
21. };