Combination Sum II--LeetCode_combinationsum2dfs-CSDN博客

本文链接：https://blog.csdn.net/Tao_Ba/article/details/78396265

1.题目

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

2.题意

在数组中查找和为target的组合，每个元素只能使用一次

所有数字 (包括目标) 都是正整数
结果不能重复

3.分析

Combination Sum的扩展
只需先将数组排序，递归过程中去除重复即可

4.代码

class Solution {
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<vector<int>> result;
        vector<int> out;

        sort(candidates.begin(), candidates.end());
        combinationSum2DFS(candidates, target, 0, out, result);

        return result;
    }

private:
    void combinationSum2DFS(vector<int> &candidates, int target,
            int start, vector<int> &out, vector<vector<int>> &result) {
        if(target < 0)
            return ;
        else if(target == 0)
        {
            result.push_back(out);
            return ;
        }
        else
        {
            for(int i = start; i < candidates.size(); ++i)
            {
                if(i > start && candidates[i] == candidates[i - 1])
                    continue;
                out.push_back(candidates[i]);
                combinationSum2DFS(candidates, target - candidates[i], i + 1, out, result);
                out.pop_back();
            }
        }
    }
};