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

题目链接：39. 组合总和

要点：回溯中的startIndex，对于同一个元素可以重复选用如何在for循环中进行控制

class Solution {
public:
    vector<int> vec;
    vector<vector<int>> result;
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        int sum = 0;
        backtracking(candidates, target, sum, 0);
        return result;
    }

    void backtracking(const vector<int>& candidates, const int& target, int& sum, int start_idx) {
        if(sum == target){
            result.push_back(vec);
            return;
        }
        if(sum > target) return;

        for(int i = start_idx; i < candidates.size(); i++) {
            sum += candidates[i];
            vec.push_back(candidates[i]);
            backtracking(candidates, target, sum, i);
            vec.pop_back();
            sum -= candidates[i];
        }
    }
};

题目链接：40.组合总和II

要点：组合问题去重：排序、used（bool数组）、以及树层去重逻辑

class Solution {
public:
    vector<int> vec;
    vector<vector<int>> result;
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());
        vector<bool> used(candidates.size(), false);
        backtracking(candidates, target, 0, 0, used);
        return result;
    }

    void backtracking(const vector<int> &candidates, const int &target, int sum, int start_idx, vector<bool>& used) {
        if(sum > target) return;
        if(sum == target){
            result.push_back(vec);
            return;
        }

        for(int i = start_idx; i < candidates.size(); i++) {
            if(i > 0 && candidates[i] == candidates[i - 1] && !used[i - 1]) continue;
            sum += candidates[i];
            vec.push_back(candidates[i]);
            used[i] = true;
            backtracking(candidates, target, sum, i + 1, used);
            sum -= candidates[i];
            vec.pop_back();
            used[i] = false;
        }
    }
    
};

题目链接：131.分割回文串

要点：分割问题分割边界在递归函数中是如何体现出来的

这道题看了卡哥讲解的逻辑没看代码部分自己就写出来了，嘿嘿

class Solution {
public:
    vector<string> vec;
    vector<vector<string>> result;
    vector<vector<string>> partition(string s) {
        backtracking(s, 0);
        return result;
    }
    
    void backtracking(const string &s, int start_idx) {
        if(start_idx == s.size()) {
            result.push_back(vec);
            return;
        }

        for(int i = start_idx; i < s.size(); i++) {
            string str(s.begin() + start_idx, s.begin() + i + 1);
            if(!huiwen(str)) continue;
            vec.push_back(str);
            backtracking(s, i + 1);
            vec.pop_back();
        }
    }

    bool huiwen(const string &s) {
        for(int i = 0, j = s.size() - 1; i < j; i++, j--) {
            if(s[i] != s[j]) return false;
        }
        return true;
    }
};