day27 第七章 回溯算法

第七章 回溯算法

今日内容
39. 组合总和
40.组合总和II
131.分割回文串

#if 0
class Solution {
private:
    vector<vector<int>> result;
    vector<int> path;
    void backtracking(vector<int>& candidates, int target, int sum, int startIndex) {
        if (sum == target) {
            result.push_back(path);
            return;
        }


        // 如果 sum + candidates[i] > target 就终止遍历
        for (int i = startIndex; i < candidates.size() && sum + candidates[i] <= target; i++) {
            sum += candidates[i];
            path.push_back(candidates[i]);
            backtracking(candidates, target, sum, i);
            sum -= candidates[i];
            path.pop_back();


        }
    }
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        result.clear();
        path.clear();
        sort(candidates.begin(), candidates.end()); // 需要排序
        backtracking(candidates, target, 0, 0);
        return result;
    }
};


#endif


#if 1
class Solution {
    vector<vector<int>> result;
    vector<int> path;
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        result.clear();
        path.clear();
        if (candidates.empty() || target < 0) return result;
        sort(candidates.begin(), candidates.end());
        backtracking(candidates, target, 0, 0);
        return result;
    }
    void backtracking(vector<int>& candidates, int target, int sum, int index) {
        if (sum == target) {
            result.push_back(path);
            return;
        }
        for (int i = index; i < candidates.size() && sum + candidates[i] <= target; ++ i) {
            path.push_back(candidates[i]);
            sum += candidates[i];
            backtracking(candidates, target, sum, i);
            sum -= candidates[i];
            path.pop_back();
        }
    }
};


#endif


#if 0
class Solution {
    vector<vector<int>> result;
    vector<int> path;
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        result.clear();
        path.clear();
        if (candidates.empty() || target < 0) return result;
        backtracking(candidates, target, 0, 0);
        return result;
    }
    void backtracking(vector<int>& candidates, int target, int sum, int index) {
        if (sum == target) {
            result.push_back(path);
            return;
        } else if (sum > target) {
            return;
        }


        for (int i = index; i < candidates.size(); ++ i) {
            path.push_back(candidates[i]);
            sum += candidates[i];
            backtracking(candidates, target, sum, i);
            sum -= candidates[i];
            path.pop_back();
        }
    }
};


#endif




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




class Solution {
    vector<vector<string>> result;
    vector<string> path;
public:
    vector<vector<string>> partition(string s) {
        result.clear();
        path.clear();
        if (s.empty()) return result;
        backtracking(s, 0);
        return result;
    }
    void backtracking(string s, unsigned int startIndex) {
        if (startIndex == s.length()) {
            result.push_back(path);
            return;
        }
        string substr;
        for (int i = startIndex; i < s.length(); ++ i) {
            substr.push_back(s[i]);
            if (ishuiwenstr(substr)) {
                path.push_back(substr);
                backtracking(s, i + 1);
                path.pop_back();
            }
        }
    }
    bool ishuiwenstr(string substr) {
        for (int i = 0, j = substr.size() - 1; i < j; ++ i, -- j) {
            if (substr[i] != substr[j]) return false;
        }
        return true;
    }
};



class Solution {
private:
    vector<vector<string>> result;
    vector<string> path; // 放已经回文的子串
    vector<vector<bool>> isPalindrome; // 放事先计算好的是否回文子串的结果
    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[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(); // 回溯过程，弹出本次已经填在的子串
        }
    }
    void computePalindrome(const string& s) {
        // isPalindrome[i][j] 代表 s[i:j](双边包括)是否是回文字串
        isPalindrome.resize(s.size(), vector<bool>(s.size(), false)); // 根据字符串s, 刷新布尔矩阵的大小
        for (int i = s.size() - 1; i >= 0; i--) {
            // 需要倒序计算, 保证在i行时, i+1行已经计算好了
            for (int j = i; j < s.size(); j++) {
                if (j == i) {isPalindrome[i][j] = true;}
                else if (j - i == 1) {isPalindrome[i][j] = (s[i] == s[j]);}
                else {isPalindrome[i][j] = (s[i] == s[j] && isPalindrome[i+1][j-1]);}
            }
        }
    }
public:
    vector<vector<string>> partition(string s) {
        result.clear();
        path.clear();
        computePalindrome(s);
        backtracking(s, 0);
        return result;
    }
};