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;
        sort(candidates.begin(),candidates.end());
        vector<int> combination;
        combinationsum(candidates,target,combination,res,0);
        return res;
    }
    
    void combinationsum(vector<int>& candidates,int target,vector<int> combination,vector<vector<int>>& res,int begin)
    {
        if(target == 0)
        {
            res.push_back(combination);
            return;
        }
        else if(target <0)
            return;
        
        for(int i=begin;i<candidates.size();i++)
        {
            if(target-candidates[i] < 0)
                return;
            combination.push_back(candidates[i]);
            combinationsum(candidates,target-candidates[i],combination,res,i);
            combination.pop_back();
        }
    }
};

还有什么更高效的解法？