[LeetCode] Combination Sum

Well, a typical backtracking problem. Make sure you are clear with the following three problems:

1. What is a partial solution and when is it finished? --- In this problem, the partial solution is a combination and it is finished once it sums to target.
2. How to find all the partial solutions? --- In the following code, I use a for-loop to traverse all the possible elements in candidates.
3. When to make recursive calls? --- In the following code, once an element is added to the partial solution, we call the function to generate the remaining elements recursively.

Of course, remember to recover to the previous status once a partial solution is done. In the following code, line 18 (comb.pop_back()) is for this purpose.

The following should be self-explanatory :)

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());
        vector<vector<int> > res;
        vector<int> comb;
        combination(candidates, 0, target, comb, res);
        return res;
    }
private:
    void combination(vector<int>& candidates, int start, int remain, vector<int>& comb, vector<vector<int> >& res) {
        if (!remain) {
            res.push_back(comb);
            return;
        }
        for (int i = start; i < (int)candidates.size(); i++) {
            if (remain >= candidates[i]) {
                comb.push_back(candidates[i]);
                combination(candidates, i, remain - candidates[i], comb, res);
                comb.pop_back();
            }
        }
    }
};