LeetCode习题笔记——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]
]

这个题目描述起来很多，其实问题很简单，就是给出一个数组和一个目标数，求所有可以相加得到目标数的组合，是一个简单的数学问题。然而在编程中会稍微复杂一点，这里采用的方法是递归，即每个数每次组合都去尝试，如果大于就结束这次递归，等于将这个数组放入结果中，小于就继续相加递归。代码如下：

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

代码不复杂，顺便还可以复习一下关于vector的操作。注意到要先将给出的数列进行排序，这样才能保证从最小的开始递归。