LeetCode习题笔记——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]
]

其实和之前的一样，只是给出的数列没事先排序，进行一下排序即可：

class Solution {  
public:  
    vector<vector<int> > combinationSum(vector<int> &candidates, int target) {  
        vector<vector<int> > res;  
        vector<int> out;  
        sort(candidates.begin(), candidates.end());  //升序排序
        combinationSumDFS(candidates, target, 0, out, res);  
        return res;  
    }  
    void combinationSumDFS(vector<int> &candidates, int target, int start, vector<int> &out, vector<vector<int> > &res) {  
        if (target < 0) return;  
        else if (target == 0) res.push_back(out);  
        else {  
            for (int i = start; i < candidates.size(); ++i) {  
                out.push_back(candidates[i]);  
                combinationSumDFS(candidates, target - candidates[i], i, out, res);  
                out.pop_back();  
            }  
        }  
    }  
};