Leetcode 39. Combination Sum

原题：

Given a set of candidate numbers (C)(without duplicates) and a target number (T), find all unique combinations inC 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]
]

解决方法：

多解的题可以用回溯的方法来解。

- 对原有数组进行排序。

- 从第一个数开始，选择将其加入到解中，接着寻找剩下的数。

- 知道该数满足要求的都已列出，然后将该数移除解。继续下一个数。

代码：

void backtrack(vector<vector<int>>& res, vector<int>& items, vector<int>& candidates, int index, int target){
        if (target == 0){
            res.push_back(items);
            return;
        }
        
        for(int i = index; i < candidates.size() && candidates[i] <= target;i++ ){
            items.push_back(candidates[i]);
            backtrack(res, items, candidates, i, target - candidates[i]);
            items.pop_back();
        }
    }
    
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<vector<int>> res;
        vector<int> items;
        sort(candidates.begin(), candidates.end());
        backtrack(res, items, candidates, 0, target);
        return res;
    }