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

39. 组合总和

思路

有重复，组合

1. 所以考虑回溯过程应该为i
2. 剪枝：可以放在for循环判断此时加入的数字大于target，省去再一次回溯

代码

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

40. 组合总和Ⅱ

思路

与39不一样的是，每一个数字只能用一次，组合，不重复

1. 给定数组中数字有重复，所以需要used数组来记录是否用过
2. 回溯过程为i + 1

代码

class Solution {
public:
    vector<vector<int>> res;
    vector<int> path;
    int sum = 0;
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());
        vector<bool> used(candidates.size(), false);
        backtracking(candidates, target, sum, 0, used);
        return res;
    }
    void backtracking(vector<int>& candidates, int target, int sum, int startIndex, vector<bool> used){
        if (sum > target) return;
        if (sum == target){
            res.push_back(path);
            return;
        }
        for (int i = startIndex; i < candidates.size(); i ++){
            if (i && candidates[i] == candidates[i - 1] && used[i - 1] == false) continue;  
            path.push_back(candidates[i]);
            sum += candidates[i];
            used[i] = true;
            backtracking(candidates, target, sum, i + 1, used);
            used[i] = false;
            sum -= candidates[i];
            path.pop_back();
            }
        }
};

131. 分割回文串

思路

和选字母类似，不过每次分割要判断一下分割的地方子串是否能为一个回文串，回文子串可以优化

代码

class Solution {
public:
    vector<vector<string>> res;
    vector<string> path;
    vector<vector<string>> partition(string s) {
        // cout << isHuiwen(s, 0, 0) << endl;
        backtracking(s, 0);
        return res;
    }
    void backtracking(string s, int startIndex){
        if (startIndex >= s.size()){
            res.push_back(path);
            return;
        }
        for (int i = startIndex; i < s.size(); i ++){
            if (isHuiwen(s, startIndex, i)){
                string s1 = s.substr(startIndex, i - startIndex + 1);
                path.push_back(s1);
            }else{
                continue;
            }
            backtracking(s, i + 1);
            path.pop_back();
        }
    }
    bool isHuiwen(string s, int start, int end){
        while (start <= end){
            if (s[start] != s[end]) return false;
            else{
                start ++;
                end --;
            }
        }
        return true;
    }
};