day27

最新推荐文章于 2024-09-06 10:38:06 发布

乌拉！哒哒哒哒哒

最新推荐文章于 2024-09-06 10:38:06 发布

阅读量93

点赞数 1

分类专栏：代码随想录打卡记录文章标签：算法

本文链接：https://blog.csdn.net/sunke123456789/article/details/138049741

版权

代码随想录打卡记录专栏收录该内容

30 篇文章 0 订阅

订阅专栏

文章介绍了三种基于递归的回溯算法：组合求和（combinationSum和combinationSum2），以及字符串切分（partition），展示了在IT技术中如何解决组合问题和字符串处理问题

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

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking(vector<int>& candidates, int target, int sum, int startIndex) {
        if (sum > target) {
            return;
        }
        if (sum == target) {
            result.push_back(path);
            return;
        }

        for (int i = startIndex; i < candidates.size(); i++) {
            sum += candidates[i];
            path.push_back(candidates[i]);
            backtracking(candidates, target, sum, i); 
            sum -= candidates[i];
            path.pop_back();
        }
    }
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        backtracking(candidates, target, 0, 0);
        return result;
    }
};

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

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

131

class Solution {
private:
    vector<vector<string>> result;
    vector<string> path; 
    void backtracking (const string& s, int startIndex) {
     
        if (startIndex >= s.size()) {
            result.push_back(path);
            return;
        }
        for (int i = startIndex; i < s.size(); i++) {
            if (isPalindrome(s, startIndex, i)) {  
                string str = s.substr(startIndex, i - startIndex + 1);
                path.push_back(str);
            } else {                               
                continue;
            }
            backtracking(s, i + 1); 
            path.pop_back(); 
        }
    }
    bool isPalindrome(const 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;
    }
public:
    vector<vector<string>> partition(string s) {
        result.clear();
        path.clear();
        backtracking(s, 0);
        return result;
    }
};