代码随想录算法训练营第二十六天| LeetCode39. 组合总和 40.组合总和 II131.分割回文串

冰冰的coco

已于 2022-10-17 00:54:24 修改

阅读量175

点赞数

分类专栏：代码随想录算法训练营文章标签： leetcode 算法 c++ 回溯法

于 2022-10-17 00:50:07 首次发布

本文链接：https://blog.csdn.net/qq_44144025/article/details/127355764

版权

代码随想录算法训练营专栏收录该内容

52 篇文章 0 订阅

订阅专栏

39. 组合总和

题目：力扣

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

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

40.组合总和II

题目：力扣

class Solution {
public:
    vector<vector<int> > result;
    vector<int> v;
    void backtracking(vector<int>& candidates, int sum,int target,int start){
        if(sum > target) return;
        if(sum == target){
            result.push_back(v);
        }
        for(int i = start; i < candidates.size(); ++i){
            //同一层的去重
            if(i > start && candidates[i] == candidates[i-1]){
                continue;
            }
            sum += candidates[i];
            v.push_back(candidates[i]);
            backtracking(candidates,sum,target,i+1);
            sum -=candidates[i];
            v.pop_back();

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

131.分割回文串

题目：力扣

class Solution {
public:
    vector<vector<string>> result;
    vector<string> ans;
    bool is_reverse(string t){
        string t1 = t;
        reverse(t1.begin(),t1.end());
        if(t1 == t) return true;
        return false;

    }
    void backtracking(string s,int start){
        if(start == s.size()){
            result.push_back(ans);
            return;
        }
        for(int i = start; i < s.size(); ++i){
            string a = s.substr(start,i - start +1);
            //string a = "";
            //for(int j = start; j <= i; ++j){
            //    a += s[j];
            //}
            if(is_reverse(a)){
                ans.push_back(a);
                backtracking(s,i+1);
                ans.pop_back();
            }
            
        }
        
    }
    vector<vector<string>> partition(string s) {
        backtracking(s,0);
        return result;
    }
};