[Leetcode从零开刷]39. Combination Sum

题目来源：leetcode

Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where the candidate numbers sums to target.

The same repeated number may be chosen from candidates unlimited number of times.

例子1：

Input: candidates = [2,3,6,7], target = 7,
A solution set is:
[
[7],
[2,2,3]
]

例子2：

Input: candidates = [2,3,5], target = 8,
A solution set is:
[
[2,2,2,2],
[2,3,3],
[3,5]
]

题意：
从数组里找出能和为目标数的所有数的组合。

题目很经典，可以用深度优先的回溯算法，代码如下：

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<vector<int>>res;
        vector<int>tmp;
        sort(candidates.begin(),candidates.end());
        dfs(candidates,0,res,tmp,target);
        return res;
    }

    void dfs(vector<int>& candidates,int start,vector<vector<int>>&res,vector<int>&tmp,int target )
    {
        if(!target)
        {
            res.push_back(tmp);
            return;
        }
        for(int i = start;i!=candidates.size()&&target>=candidates[i];i++)
        {
            tmp.push_back(candidates[i]);
            dfs(candidates,i,res,tmp,target-candidates[i]);
            tmp.pop_back();
        }

    }
};