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.
•Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
•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]

Difficulty: Medium

翻译&分析：

Combination Sum系列的第二道，要求大体一样，给定一个数列，找到所有和为target的子集合，只是元素不能重复利用，实际上难度较上道题算是简单了，leetcode上某一系列的题老是第二道最简单，这里直接给出代码，详细分析见上一道题：Combination Sum题解

代码：

class Solution {
    vector<vector<int>> res;
    vector<int> temp;
public:

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

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

};

不用for循环的代码跟上一道题也几乎一样，这里不再赘述