Algorithm：组合总和 II

给定一个候选人编号的集合 candidates 和一个目标数 target ，找出 candidates 中所有可以使数字和为 target 的组合。

candidates 中的每个数字在每个组合中只能使用 一次 。

注意：解集不能包含重复的组合。 

 

示例 1:

输入: candidates = [10,1,2,7,6,1,5], target = 8,
输出:
[
[1,1,6],
[1,2,5],
[1,7],
[2,6]
]
示例 2:

输入: candidates = [2,5,2,1,2], target = 5,
输出:
[
[1,2,2],
[5]
]
 

提示:

1 <= candidates.length <= 100
1 <= candidates[i] <= 50
1 <= target <= 30

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/combination-sum-ii
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

class Solution {
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<vector<int>> result;
        sort(candidates.begin(), candidates.end());

        if(candidates.size() < 1)
        {
            return result;
        }

        if(target == candidates[0])
        {
            vector<int> data{target};
            result.push_back(data);
            return result;
        }

        if(target < candidates[0] || candidates.size() == 1)
        {
            return result;
        }

        vector<int> ncandidates;
        ncandidates.assign(candidates.begin() + 1, candidates.end());

        vector<vector<int>> nresult;

        nresult = combinationSum2(ncandidates, target - candidates[0]);

        for(int i = 0; i < nresult.size(); i++)
        {
            nresult[i].insert(nresult[i].begin(), candidates[0]);
        }

        result = nresult;

        vector<vector<int>> wresult;
        int index = 0;

        while(ncandidates[index] == candidates[0])
        {
            index++;
            if(index == ncandidates.size())
            {
                break;
            }
        }

        if(index < ncandidates.size())
        {
            vector<int> wcandidates;
            wcandidates.assign(ncandidates.begin() + index, ncandidates.end());

            wresult = combinationSum2(wcandidates, target);
        }

        result.insert(result.end(), wresult.begin(), wresult.end());

        return result;
    }
};