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]
]

题目链接：

---

思路分析

给一个数组candidates，数组中元素都不相同，给一个target值，candidates中的元素可以无限次使用，找到所有能够加合成target的集合。

将candidates排序，从小到大开始递归寻找。递归每次都从candidates的第一个元素开始，每次target剪去一个candidates的元素值，然后继续进行递归。为了防止重复，设置一个start值，表示start之前的candidates的元素就不需要遍历了，因为在前面已经递归过了。

代码

class Solution {
public:
    vector<vector<int>> res;
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());
        vector<int> temp;
        combinationHelpler(candidates, temp, target, 0);

        return res;
    }

    void combinationHelpler(vector<int>& candidates, vector<int> temp, int target, int start){
        if (target > 0)
            for(int i = start; i < candidates.size() && target >= candidates[i]; i++){
                temp.push_back(candidates[i]);
                combinationHelpler(candidates, temp, target - candidates[i], i);
                temp.pop_back();
            }
        else if (target == 0){
            res.push_back(temp);
        }
    }
};

时间复杂度：$O(未知)$
空间复杂度：$O(未知)$

---

反思

一开始多递归了一层，导致有重复元素出现，这个题目的思路还是很清晰的，类似于不断枚举的一个遍历。