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

大致题意：
给一组无重复的正整数集合以及一个target和，在集合内找到所有不同的组合，使得每个组合内所有数总和等于target。原集合内的一个数可以用无限多次。

---

基本上看到这种求所有解的问题都是dfs或者bfs，这道题应该是dfs更好写一些。唯一要注意的是，一个数可以用多次，所以每次递归起始位置不用前进。

class Solution {
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        vector<vector<int>> ans;
        int n = candidates.size();
        if (n == 0) {
            return ans;
        }
        sort(candidates.begin(), candidates.end());
        vector<int> current;
        dfs(candidates, 0, target, ans, current);
        return ans;
    }

    void dfs(vector<int> &nums, int start, int target, vector<vector<int>> &ans, vector<int>& current) {
        if (target < 0) {
            return;
        } else if (target == 0) {
            ans.push_back(current);
            return;
        }
        for (int i = start; i < nums.size(); i++) {
            current.push_back(nums[i]);
            dfs(nums, i, target - nums[i], ans, current);
            current.pop_back();
        }
    }
};

原题链接

第一次用markdown编辑器。。感觉很可怕