LeetCode 39: Combination Sum

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 ($a_1, a_2, \ldots , a_k)$ must be in non-descending order. (ie, $a_1 ≤ a_2 ≤ \ldots ≤ a_k$).
• 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]

解题思路

可以用回溯法（Backtracking）求解。

---

代码一：

class Solution {
private:
    void internalCombinationSum(vector<int> &candidates, int i, int target, vector<int> &path, vector<vector<int> > &res) {
        // 不可能找到合法的解，回溯
        if ((target < 0) || (i >= candidates.size() && target > 0)) return;

        // 找到了一组解
        if (target == 0) {
            res.push_back(path);
            return;
        }

        int repeate = target / candidates[i]; // candidates[i] 可以重复的次数
        for (int r = 0; r <= repeate; ++r) {
            path.insert(path.end(), r, candidates[i]);

            // 递归
            internalCombinationSum(candidates, i + 1, target - r * candidates[i], path, res);

            path.erase(path.end() - r, path.end());
        }
    }    
public:
    vector<vector<int> > combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end()); // 排序

        vector<int> path;
        vector<vector<int> > result;
        internalCombinationSum(candidates, 0, target, path, result);

        return result;
    }
};

---

代码二：

class Solution {
private:
    void internalCombinationSum(vector<int> &candidates, int idx, int target, vector<int> &path, vector<vector<int> > &res) {
        if (target == 0) {
            res.push_back(path);
        }
        else {
            // i starts from idx to make sure results are distinct.
            for (size_t i = idx; i < candidates.size(); ++i) {
                if (target >= candidates[i]) {
                    path.push_back(candidates[i]);
                    // 递归
                    internalCombinationSum(candidates, i, target - candidates[i], path, res);
                    path.pop_back();
                }
            }
        }
    }  

public:
    vector<vector<int> > combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end()); // 排序

        vector<int> path;
        vector<vector<int> > result;
        internalCombinationSum(candidates, 0, target, path, result);

        return result;
    }
};