[Leetcode] #39#40#216 Combination Sum I & II & III

Discription:

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

Solution:

void combinationSum(vector<int>& candidates, int target, int begin, vector<vector<int>> &result, vector<int> &temp) //解法1
{
    if (target == 0) {
        result.push_back(temp);
        return;
    }
    for (int i = begin; i < candidates.size() && target >= candidates[i]; i++) {
        temp.push_back(candidates[i]);
        combinationSum(candidates, target - candidates[i], i, result, temp);
        temp.pop_back();
    }
}


vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
    vector<vector<int>> result;
    vector<int> temp;
    sort(candidates.begin(), candidates.end());
    combinationSum(candidates, target, 0, result, temp);
    return result;
}

void combinationSum(vector<int>& candidates, int target, int begin, vector<vector<int>> &result, vector<int> &temp) //解法2
{
    if (target<0)
        return;
    if (target == 0) {
        result.push_back(temp);
        return;
    }
    for (int i = begin; i < candidates.size(); i++) {
        temp.push_back(candidates[i]);
        combinationSum(candidates, target - candidates[i], i, result, temp);
        temp.pop_back();
    }
}

vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
    vector<vector<int>> result;
    vector<int> temp;
    combinationSum(candidates, target, 0, result, temp);
    return result;
}

Discription:

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

Solution:

void combinationSum2(vector<int>& candidates, int target, vector<vector<int>> &result, vector<int> &temp, int begin)
{
    if (target == 0) {
        result.push_back(temp);
        return;
    }
    for (int i = begin; i < candidates.size() && target >= candidates[i]; ++i) {
        if (i != begin && candidates[i] == candidates[i - 1])
            continue;
        temp.push_back(candidates[i]);
        combinationSum2(candidates, target - candidates[i], result, temp, i + 1);
        temp.pop_back();
    }
}

vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
    vector<vector<int>> result;
    vector<int> temp;
    sort(candidates.begin(), candidates.end());
    combinationSum2(candidates, target, result, temp, 0);
    return result;
}

Discription:

Find all possible combinations of k numbers that add up to a number n, given that only numbers from 1 to 9 can be used and each combination should be a unique set of numbers.

Example 1:

Input: k = 3, n = 7

Output:

[[1,2,4]]

Example 2:

Input: k = 3, n = 9

Output:

[[1,2,6], [1,3,5], [2,3,4]]

Solution:

void combinationSum3(int k, int n, int num, vector<int> &temp, vector<vector<int>> &result) {
    if (k == 0) {
        if (n == 0)
            result.push_back(temp);
        return;
    }
    for (int i = num; i <= 9 && n >= i; i++) {
        temp.push_back(i);
        combinationSum3(k - 1, n - i, i + 1, temp, result);
        temp.pop_back();
    }
}


vector<vector<int>> combinationSum3(int k, int n) {
    vector<vector<int>> result;
    vector<int> temp;
    combinationSum3(k, n, 1, temp, result);
    return result;
}

GitHub-Leetcode:https://github.com/wenwu313/LeetCode