Day27 回溯算法part03 39. 组合总和 40. 组合总和 II 131. 分割回文串

回溯算法part03 39. 组合总和 40. 组合总和 II 131. 分割回文串

39. 组合总和

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
public:
    void traversal(vector<int>& candidates, int target,int sum,int startIndex){
        if(sum> target) return; //剪枝操作
        if(sum==target){
            result.emplace_back(path);
            return;
        }
        for(int i = startIndex; i<candidates.size();i++){
            sum+=candidates[i];
            path.emplace_back(candidates[i]);
            traversal(candidates,target,sum,i);//不用i+1了，表示可以重复读取当前的数
            sum-=candidates[i];
            path.pop_back();
        }
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        traversal(candidates,target,0,0);
        return result;
    }
};

40. 组合总和 II

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void traversal(vector<int>& candidates, int target,int sum,int startIndex){
        if(sum>target) return;
        if(sum==target){
            result.emplace_back(path);
            return;
        }
        for(int i =startIndex; i<candidates.size();i++){
            // 要对同一树层使用过的元素进行跳过
            if (i > startIndex && candidates[i] == candidates[i - 1]) {
                continue;
            }
            sum+=candidates[i];
            path.push_back(candidates[i]);
            traversal(candidates,target,sum,i+1);//i+1目的是candidates 中的每个数字在每个组合中只能使用 一次
            sum-=candidates[i];
            path.pop_back();
        }
    }
public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end()); //从小到大排序
        traversal(candidates,target,0,0);
        return result;
    }
};

131. 分割回文串

class Solution {
private:
    vector<vector<string>> result;
    vector<string> path; // 放已经回文的子串
    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:
    void backTracking(const string& s,int startIndex){ //startIndex判断结束条件
        if(startIndex>=s.size()) {
            result.push_back(path);
            return;
        }
        for (int i = startIndex; i < s.size(); i++){
            if(isPalindrome(s,startIndex,i)){
                path.push_back(s.substr(startIndex,i-startIndex+1)); //从startIndex开始切割i-startIndex+1个元素
            }else continue;
            backTracking(s,i+1);
            path.pop_back();
        }

    }
    vector<vector<string>> partition(string s) {
        backTracking(s,0);
        return result;
    }
};