算法训练Day23 | ● 39. 组合总和 ● 40.组合总和II ● 131.分割回文串

最新推荐文章于 2024-06-16 20:54:56 发布

WIIIter

最新推荐文章于 2024-06-16 20:54:56 发布

阅读量124

点赞数 3

分类专栏： LeetCode刷题文章标签：算法深度优先 leetcode

本文链接：https://blog.csdn.net/WIIIter/article/details/138587494

版权

LeetCode刷题专栏收录该内容

49 篇文章 0 订阅

订阅专栏

39. 组合总和

class Solution {
public:
    vector<vector<int>> result;
    vector<int> temp;
    void backtracking(int begin, vector<int>& candidates, int target, int sum){
        if(sum>=target){
            if(sum == target){
                result.push_back(temp);
            }
            return;
        }
        for(int i=begin; i<candidates.size();i++){
            temp.push_back(candidates[i]);
            sum += candidates[i];
            backtracking(i, candidates, target, sum);
            temp.pop_back();
            sum -= candidates[i];
        }

    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        backtracking(0, candidates, target, 0);
        return result;
    }
};

参考文章：代码随想录-39. 组合总和

40.组合总和II

class Solution {
public:
    vector<vector<int>> result;
    vector<int> temp;
    void backtracking(int begin, vector<int>& candidates, int target, int sum){
        if(sum>=target){
            if(sum == target){
                result.push_back(temp);
            }
            return;
        }
        for(int i=begin; i<candidates.size();i++){
            if(i > begin && candidates[i] == candidates[i-1]){
                continue;
            }
            temp.push_back(candidates[i]);
            sum += candidates[i];
            backtracking(i+1, candidates, target, sum);
            temp.pop_back();
            sum -= candidates[i];
        }

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

    }
};

参考文章：代码随想录-40.组合总和II

131.分割回文串

class Solution {
public:
    vector<vector<int>> result;
    vector<int> temp;
    void backtracking(int begin, vector<int>& candidates, int target, int sum){
        if(sum>=target){
            if(sum == target){
                result.push_back(temp);
            }
            return;
        }
        for(int i=begin; i<candidates.size();i++){
            if(i > begin && candidates[i] == candidates[i-1]){
                continue;
            }
            temp.push_back(candidates[i]);
            sum += candidates[i];
            backtracking(i+1, candidates, target, sum);
            temp.pop_back();
            sum -= candidates[i];
        }

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

    }
};