代码随想录算法训练营刷题Day27|39.组合总和、40.组合总和II、131.分割回文串

39.组合总和

1、关键：StartIndex就是下一次取哪里

2、关键代码：

if(sum < target)
    backtracking(candidates, target, sum, i); //递归
else
    backtracking(candidates, target, sum, i+1); //递归

3、总代码：

class Solution {
private:
    vector<int> path;
    vector<vector<int>> res;
    void backtracking(vector<int>& candidates, int target,int sum, int StartIndex){
        //递归终止条件
        if(sum >= target){
            if(sum == target)
                res.push_back(path);
            return;
        }
        for(int i=StartIndex; i<candidates.size(); i++){
            path.push_back(candidates[i]);
            sum += candidates[i];
            if(sum < target)
                backtracking(candidates, target, sum, i); //递归
            else
                backtracking(candidates, target, sum, i+1); //递归
            sum -= candidates[i];   //回溯
            path.pop_back();        //回溯
        }
    }
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        backtracking(candidates, target, 0, 0);
        return res;
    }
};

40.组合总和II

1、关键：去重

2、另外：双指针法是删除连续重复的元素

另外：vector不能作为map的key，除非重载

3、代码：

class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking(vector<int>& candidates, int target, int sum, int startIndex, vector<bool>& used) {
        if (sum == target) {
            result.push_back(path);
            return;
        }
        for (int i = startIndex; i < candidates.size() && sum + candidates[i] <= target; i++) {
            // used[i - 1] == true，说明同一树枝candidates[i - 1]使用过
            // used[i - 1] == false，说明同一树层candidates[i - 1]使用过
            // 要对同一树层使用过的元素进行跳过
            if (i > 0 && candidates[i] == candidates[i - 1] && used[i - 1] == false) {
                continue;
            }
            sum += candidates[i];
            path.push_back(candidates[i]);
            used[i] = true;
            backtracking(candidates, target, sum, i + 1, used); // 和39.组合总和的区别1，这里是i+1，每个数字在每个组合中只能使用一次
            used[i] = false;
            sum -= candidates[i];
            path.pop_back();
        }
    }

public:
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        vector<bool> used(candidates.size(), false);
        path.clear();
        result.clear();
        // 首先把给candidates排序，让其相同的元素都挨在一起。
        sort(candidates.begin(), candidates.end());
        backtracking(candidates, target, 0, 0, used);
        return result;
    }
};

131.分割回文串 

1、关键：

2、代码：

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)){ //是回文子串
                //获取[StartIndex, i]在s中的子串
                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) {
        backtracking(s, 0);
        return result;
    }
};