Leetcode 39：Combination Sum

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.

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.
Example 1:

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

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

C++
vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        std::sort(candidates.begin(),candidates.end());
        vector<vector<int>> res;
        vector<int> item;
        DFS(candidates,item,target,res,0);
        return res;
    }
    void DFS(vector<int>& candidates,vector<int> item,int sum,vector<vector<int>>& res,int n)
    {
        if(sum == 0)
            res.push_back(item);
        if(sum < 0)
            return ;
        for(int i = n;i < candidates.size();++i)
        {
            item.push_back(candidates[i]);
            DFS(candidates,item,sum-candidates[i],res,i);
            item.pop_back();
        }
    }