Leetcode 40. Combination Sum II

最新推荐文章于 2019-05-10 10:55:45 发布

SnailTyan

最新推荐文章于 2019-05-10 10:55:45 发布

阅读量403

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode 文章标签： Leetcode

本文链接：https://blog.youkuaiyun.com/Quincuntial/article/details/83095972

Leetcode 同时被 2 个专栏收录

409 篇文章

订阅专栏

Algorithm

260 篇文章

订阅专栏

本文提供了三种使用C++解决LeetCode上组合总和II问题的不同版本代码实现，详细展示了如何通过递归和回溯算法寻找候选数集中所有可能的组合，使得组合之和等于目标值，同时避免重复组合。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

文章作者：Tyan
博客：noahsnail.com | 优快云 | 简书

1. Description

Combination Sum II

2. Solution

Version 1

class Solution {
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        set<vector<int>> s;
        sort(candidates.begin(), candidates.end());
        vector<int> combination;
        combinationSum2(s, candidates, combination, target, 0, 0);
        return vector<vector<int>>(s.begin(), s.end());
    }


private:
    void combinationSum2(set<vector<int>>& result, vector<int>& candidates, vector<int>& combination, int& target, int sum, int begin) {
        if(sum > target) {
            return;
        }
        if(sum == target) {
            result.insert(combination);
            return;
        }
        for(int i = begin; i < candidates.size(); i++) {
            combination.push_back(candidates[i]);
            combinationSum2(result, candidates, combination, target, sum + candidates[i], i + 1);
            combination.pop_back();
        }
    }
};

Version 2

class Solution {
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        set<vector<int>> s;
        sort(candidates.begin(), candidates.end());
        vector<int> combination;
        combinationSum2(s, candidates, combination, target, 0, 0);
        return vector<vector<int>>(s.begin(), s.end());
    }


private:
    void combinationSum2(set<vector<int>>& result, vector<int>& candidates, vector<int>& combination, int& target, int sum, int begin) {
        if(sum > target) {
            return;
        }
        if(sum == target) {
            result.insert(combination);
            return;
        }
        for(int i = begin; i < candidates.size(); i++) {
            if(sum + candidates[i] > target) {
                break;
            }
            combination.push_back(candidates[i]);
            combinationSum2(result, candidates, combination, target, sum + candidates[i], i + 1);
            combination.pop_back();
        }
    }
};

Version 3

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


private:
    void combinationSum2(vector<vector<int>>& result, vector<int>& candidates, vector<int>& combination, int& target, int sum, int begin) {
        if(sum > target) {
            return;
        }
        if(sum == target) {
            result.push_back(combination);
            return;
        }
        for(int i = begin; i < candidates.size(); i++) {
            if(sum + candidates[i] > target) {
                break;
            }
            if(i > begin && candidates[i] == candidates[i - 1]) {
                continue;
            }
            combination.push_back(candidates[i]);
            combinationSum2(result, candidates, combination, target, sum + candidates[i], i + 1);
            combination.pop_back();
        }
    }
};