算法训练营笔记day26|39. 组合总和、40. 组合总和 II、131. 分割回文串

最新推荐文章于 2024-07-18 10:23:21 发布

weixin_45662787

最新推荐文章于 2024-07-18 10:23:21 发布

阅读量47

点赞数

文章标签：算法深度优先 leetcode

本文链接：https://blog.csdn.net/weixin_45662787/article/details/129788296

版权

39. 组合总和

题目连接

笔记

如果dfs里的index是0不是i，则结果会重复

class Solution {
public:
    vector<vector<int>> result;
    vector<int> tem;
    void dfs(vector<int>& candidates, int target, int sum, int index) {
        if (sum >= target) {
            if (sum == target) result.push_back(tem);
            return;
        }
        for (int i = index; i < candidates.size(); i++) {
            tem.push_back(candidates[i]);
            dfs(candidates, target, sum + candidates[i], i);
            tem.pop_back();
        }
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        dfs(candidates, target, 0, 0);
        return result;
    }
};

40. 组合总和 II

题目连接

笔记

去重要立马想到排序

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

131. 分割回文串

题目连接

笔记

class Solution {
public:
    vector<vector<string>> result;
    vector<string> tem;
    bool isPalindrome(string& s, int start, int end) {
        for (int i = start, j = end; i < j; i++, j--) {
            if (s[i] != s[j]) return false;
        }
        return true;
    }
    void dfs(string& s, int index) {
        if (index >= s.size()) {
            result.push_back(tem);
            return;
        }
        for (int i = index; i < s.size(); i++) {
            if (isPalindrome(s, index, i)) {
                string str = s.substr(index, i - index + 1);
                tem.push_back(str);
            }
            else continue;
            dfs(s, i + 1);
            tem.pop_back();
        }
    }
    vector<vector<string>> partition(string s) {
        dfs(s, 0);
        return result;
    }
};