Combination Sum II

Combination Sum II

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

Subscribe to see which companies asked this question

解题思路：

这道题与Combination Sum基本相同，不同的地方在于：1、candidate set 中的元素在某个解中只能使用一次 2、candidate set 中存在重复的元素，因此，需要进行判断得到的解是否已经存在。

代码：

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
vector< vector<int> > res0;
void combine(vector<int> candidates, vector<int>& res, int &sum, int start, int target)
{
    for(int i = start; i < candidates.size(); i ++)
    {
        if(sum + candidates[i] > target) return;
        else if(sum + candidates[i] < target)
        {
            res.push_back(candidates[i]);
            sum = sum + candidates[i];
            combine(candidates, res, sum, i + 1, target); //注意:此处的i+1,一方面避免重复解，另一方面保证每个元素在每个解中只使用一次
            res.pop_back();
            sum = sum - candidates[i];
        }
        else
        {
            res.push_back(candidates[i]);
            sum = sum + candidates[i];
            //判断是否存在相同的结果
            bool sim = true;
            for(int j = 0; j < res0.size(); j ++)
            {
                if(res0[j].size() != res.size()) continue;
                for(int k = 0; k < res0[j].size(); k ++)
                {
                    if(res0[j][k] != res[k])
                    {
                        sim = false;
                        break;
                    }
                }
                if(sim == true)
                {
                    res.pop_back();
                    sum = sum - candidates[i];
                    return;
                }
                sim = true;
            }
            res0.push_back(res);
            res.pop_back();
            sum = sum - candidates[i];
            return;
        }
    }
}

vector< vector<int> > combinationSum2(vector<int>& candidates, int target)
{
    vector<int> res;
    int sum = 0, start = 0;
    sort(candidates.begin(), candidates.end());
    combine(candidates, res, sum, start, target);
    return res0;
}

int main()
{
    vector<int> candidates;
    vector< vector<int> > res;
    int target,num;
    cin>>target;
    while(cin>>num)
    {
        candidates.push_back(num);
    }
    res = combinationSum2(candidates, target);
    for(int i = 0; i < res.size(); i++)
    {
        for(int j = 0; j < res[i].size(); j++)
        {
            cout<<res[i][j]<<' ';
        }
        cout<<endl;
    }
}