[LeetCode] (medium) 39. Combination Sum

https://leetcode.com/problems/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]
]

---

如果candidate集合中没有零或负数，则dfs的过程显然

仔细考虑就会发现candidate中必然没有零或负数，因为：1、如果有零则答案无限多（可以添加任意多个零） 2、如果有负数，任取一个正数与负数绝对值的最小公倍数，对应于这两者组合成零的情况

class Solution {
public:
    vector<vector<int>> result;
    
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<int> inter_nums;
        sort(candidates.begin(), candidates.end());
        dfs(candidates, inter_nums, 0, target, 0);
        return result;
    }
    
    void dfs(vector<int> &candidates, vector<int> &inter_nums, int cur_num, int target, int st){
        if(cur_num > target){
            return;
        }else if(cur_num == target){
            result.push_back(inter_nums);
        }else{
            for(int i = st; i < candidates.size(); ++i){
                if(cur_num + candidates[i] > target) break;
                inter_nums.push_back(candidates[i]);
                dfs(candidates, inter_nums, cur_num+candidates[i], target, i);
                inter_nums.pop_back();
            }
        }
    }
};

*有问题，可能会造成最后的返回集合中有重复的组合（但是这些组合中的相同数字来自集合中的不同位置）