代码随想录day23 39. 组合总和、 40.组合总和II 、131.分割回文串

最新推荐文章于 2024-07-29 10:36:27 发布

咸鱼的自我变强之路

最新推荐文章于 2024-07-29 10:36:27 发布

阅读量97

点赞数 1

分类专栏：代码随想录_刷题文章标签： leetcode 算法

本文链接：https://blog.csdn.net/weixin_45461296/article/details/140702891

版权

代码随想录_刷题专栏收录该内容

35 篇文章 0 订阅

订阅专栏

代码随想录day23 39. 组合总和、 40.组合总和II 、131.分割回文串

39. 组合总和

代码随想录

居然自己写出来，需要注意的是重复组合的避免

class Solution {
public:

    vector<vector<int>> res;
    vector<int> path;
    void traversal(vector<int>& candidates, int target, int startIndex) {
        if (target < 0) {
            return;
        }
        if (target == 0) {
            res.push_back(path);
            return;
        }
        for (int i = startIndex; i < candidates.size(); i++) {
            path.push_back(candidates[i]);
            traversal(candidates, target - candidates[i], i);
            path.pop_back();
        }
    }

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

40.组合总和II

代码随想录

相比上题，其实就是多了部分单层需要跳到和左边值不一样的下标

class Solution {
public:

    vector<vector<int>> res;
    vector<int> path;
    void traversal(vector<int>& candidates, int target, int startIndex) {
        if (target < 0) {
            return;
        }
        if (target == 0) {
            res.push_back(path);
            return;
        }
        int i = startIndex;
        while (i < candidates.size()) {
            path.push_back(candidates[i]);
            traversal(candidates, target - candidates[i], i + 1);
            path.pop_back();
            i++;
            while (i < candidates.size() && candidates[i] == candidates[i - 1]) {
                i++;
            }
        }
    }


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

131.分割回文串

代码随想录

#include<bits/stdc++.h>
using namespace std;

class Solution {
public:
    vector<vector<string>> res;
    vector<string> path;
    void traversal(const string &s, int startIndex) {
        if (startIndex == s.size()) {
            res.push_back(path);
            return;
        }
        for (int i = startIndex; i < s.size(); i++) {
            if (isPalindrome(s, startIndex, i)) {
                string tmp = s.substr(startIndex, i - startIndex + 1);
                path.push_back(tmp);
                traversal(s, i + 1);
                path.pop_back();
            }
        }
    }


    bool isPalindrome(const string &s, int startIndex, int endIndex) {
        for (int i = startIndex, j = endIndex; i <= j; i++, j--) {
            if (s[i] != s[j]) {
                return false;
            }
        }
        return true;
    }

    vector<vector<string>> partition(string s) {
        traversal(s,0);
        return res;
    }
};