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

39. 组合总和

39. 组合总和

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

            //有重复元素时剪枝，本题无重复可省略
            //if(i > 0 && candidates[i] == candidates[i-1]) continue;

            path.push_back(candidates[i]);
            backtracking(candidates, target - candidates[i], i);
            path.pop_back();
        }
        

        
    }
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());
        backtracking(candidates, target, 0);
        return ans;
    }
};

40.组合总和II

40. 组合总和 II

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

            //有重复元素时剪枝
            if(i > startindex && candidates[i] == candidates[i-1]) continue;

            path.push_back(candidates[i]);
            backtracking(candidates, target - candidates[i], i+1); //元素本身只能用1次 i+1
            path.pop_back();
        }
        
        
    }
    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());
        backtracking(candidates, target, 0);
        return ans;
    }
};

131.分割回文串

131. 分割回文串

对于回文串的判断函数可以进一步优化（还没看，先掌握一种）

class Solution {
private:
    vector<vector<string>> result;
    vector<string> path; // 放已经回文的子串
    void backtracking (const string& s, int startIndex) {
        // 如果起始位置已经大于s的大小，说明已经找到了一组分割方案了
        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); // 寻找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;
    }
};