【LC刷题】DAY20：77 216 17

【LC刷题】DAY19：39 40 131

39. 组合总和 link

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

40. 组合总和 II link

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

131. 分割回文串 link

class Solution {
public:
    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;
    }
    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)){
                string str = s.substr(startIndex, i - startIndex + 1);
                path.push_back(str);
            }else{
                continue;
            }
            backtracking(s, i + 1);
            path.pop_back();
        }
    }
    vector<vector<string>> partition(string s) {
        backtracking(s, 0);
        return result;
    }
};