Leetcode 39 - Combination Sum

Given a set of candidate numbers (C) 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.
Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
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) {
        //为保证元素升序排列，故先进行排序
        sort(candidates.begin(),candidates.end());
        vector<vector<int>> result;
        vector<int> temp;
        dfs(candidates,result,target,temp,0);
        return result;
    }
private:
    //由于要求元素升序排列，dfs函数设定中start参数，用于记录递归开始前遍历到的下标
    void dfs(vector<int> &candidates,vector<vector<int>> &result,int gap,vector<int> &temp,int start){
        //找到合法组合，将此结果加入结果集
        if(gap==0){
            result.push_back(temp);
            return;
        }
        for(int i=start;i<candidates.size();i++){
            //组合非法，直接返回
            if(candidates[i]>gap) return;
            temp.push_back(candidates[i]);
            dfs(candidates,result,gap-candidates[i],temp,i);
            temp.pop_back();
        }
    }
};