【代码随想录】day27

最新推荐文章于 2024-07-24 22:13:06 发布

weixin_47041555

最新推荐文章于 2024-07-24 22:13:06 发布

阅读量199

点赞数 2

文章标签：算法 leetcode 数据结构

本文链接：https://blog.csdn.net/weixin_47041555/article/details/137021828

版权

本文介绍了三种编程问题：利用回溯法求解39和40个整数的组合总和，优化过的40组合总和II，以及131分割回文串。重点在于理解回溯算法在构建树形结构和编写过滤条件的应用。

摘要由CSDN通过智能技术生成

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

一、39组合总和

class Solution {
public:
    vector<vector<int>> res;
    vector<int> path;
    void backtracking(vector<int>& nums, int sumNum, int target, int startNum) {
        if (sumNum == target) {
            res.push_back(path);
        }
        if (sumNum >= target || startNum == nums.size()) {
            return;
        }
        for (int i = startNum; i < nums.size(); i ++) {
            path.push_back(nums[i]);
            backtracking(nums, sumNum + nums[i], target, i);
            path.pop_back();
        }

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

二、40组合总和II

class Solution {
public:
    vector<vector<int>> res;
    vector<int> path;
    void backtracking(vector<int>& nums, int sum, int target, int startNum) {
        if (sum == target) {
            res.push_back(path);
        }
        if (sum >= target || startNum == nums.size()) {
            return;
        }
        for (int i = startNum; i < nums.size(); i ++) {
            if (path.size() == 0 && i > 0 && nums[i] == nums[i-1]) {
                continue;
            }
            if (i > startNum && nums[i] == nums[i-1]) {
                continue;
            }
            path.push_back(nums[i]);
            backtracking(nums, sum + nums[i], target, i + 1);
            path.pop_back();
        }

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

使用used数组树层去重很难想，感觉不如直接画出树形图按广度、深度分别写过滤条件来得容易。

三、131分割回文串

class Solution {
public:
    vector<vector<string>> res;
    vector<string> path;
    bool isValid(string s, int startIndex, int endIndex) {
        for (int left = startIndex, right = endIndex - 1; left < right; left ++, right --) {
            if (s[left] != s[right]) {
                return false;
            }
        }
        return true;
    }

    void backtracking(string s, int length) {
        if (length == s.size()) {
            res.push_back(path);
        }
        if (length >= s.size()) {
            return;
        }
        for (int len = 1; len <= s.size() - length; len ++) {
            if (isValid(s, length, length + len) == false) {
                continue;
            }
            string temp = s.substr(length, len);
            path.push_back(temp);
            backtracking(s, length + temp.size());
            path.pop_back();
        }
    }

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