Combination SumⅠ&Ⅱ (第十八周)

Combination Sum Ⅰ

Given a set of candidate numbers (C) (without duplicates) 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.
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]
]

算法思路

（1）题目是说给定一组数和一个目标值，从集合中选取一些数，使得和等于目标值，求出全部这样组合。
（2）那其实就是一个深搜就可以，每次遍历一个数。如果要这个数，就在这个位置进行递归。如果不要这个数，在这个数后面的位置进行递归。
（3）输出要从小到大，所以在递归深搜的时候，要先从小到大排序。

算法代码

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

Combination Sum Ⅱ

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

Each number in C may only be used once in the combination.

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.

For example, given candidate set [10, 1, 2, 7, 6, 1, 5] and target 8,
A solution set is:

[
[1, 7],
[1, 2, 5],
[2, 6],
[1, 1, 6]
]

算法思路

题目和上面差不多，只不过每个数字只能用一次。所以每一次递归，都是从下一个数字开始。

算法代码

  class Solution {
private:
    vector<vector<int> > result;
    vector<int> path;
public:
    vector<vector<int> > combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        dfs(candidates,target,0,0);
        return result;
    }
    void dfs(vector<int>& candidates, int target,int pos,int cur){
        if(cur == target){
            result.push_back(path);
            return;
        }
        else if(cur > target)
            return;
        else{
            for(int i = pos; i < candidates.size(); i++){
                path.push_back(candidates[i]);
                dfs(candidates,target,i + 1,cur + candidates[i]);
                path.pop_back();
                while(candidates[i] == candidates[i + 1])
                    i++;
            }
        }
    }
};