Combination Sum--LeetCode

1.题目

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

2.题意

在数组中查找和为target的组合，每个元素可以重复使用多次

所有数字 (包括目标) 都是正整数
结果不能重复

3.分析

另写一个递归函数，新加入三个变量
start记录当前递归到的下标，out保存每次递归的可能结果，result保存所有可能的结果
每次调用新的递归函数时，target减去数组中当前元素

4.代码

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<vector<int>> result;
        vector<int> out;

        combinationSumDFS(candidates, target, 0, out, result);

        return result;
    }

private:
    void combinationSumDFS(vector<int>& candidates, int target,
            int start, vector<int> &out, vector<vector<int>> &result) {
        if(target < 0)
            return ;
        else if(target == 0)
        {
            result.push_back(out);
            return ;
        }
        else
        {
            for(int i = start; i < candidates.size(); ++i)
            {
                out.push_back(candidates[i]);
                combinationSumDFS(candidates, target - candidates[i], i, out, result);
                out.pop_back();
            }
        }
    }
};