回溯算法题集

回溯算法套路①子集型回溯【基础算法精讲 14】_哔哩哔哩_bilibili 

力扣17. 电话号码的字母组合

class Solution {
    string h[10] = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
    char ans[4];
    int cnt = 0;
public:
    vector<string> letterCombinations(string digits) {
        vector<string> ret;
        int n = digits.size();
        if(!n)  return {};
        function<void(int)> dfs = [&](int u){
            if(u == n){
                string res = "";
                for(int i = 0; i < cnt; i++)
                    res += ans[i];
                ret.push_back(res);
                return;
            }
            for(char c : h[digits[u] - '0']){
                ans[cnt++] = c;
                dfs(u + 1);
                cnt--;
            }
        };

        dfs(0);
        return ret;
    }
};

子集型回溯

力扣78. 子集

class Solution {
    vector<int> ans;
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        int n = nums.size();
        vector<vector<int> > ret;
        
        function<void(int)> dfs = [&](int u){
            if(u == n){
                ret.push_back(ans);
                return;
            }

            //not choose
            dfs(u + 1);
            //choose
            ans.push_back(nums[u]);
            dfs(u + 1);
            ans.pop_back();
        };

        dfs(0);

        return ret;
    }
};

模板二：从答案的角度选择（选择第一个、选择第二个···）

class Solution {
    vector<int> ans;
public:
    vector<vector<int>> subsets(vector<int>& nums) {
        int n = nums.size();
        vector<vector<int> > ret;
        
        function<void(int)> dfs = [&](int u){
            ret.push_back(ans);

            for(int i = u; i < n; i++){
                ans.push_back(nums[i]);
                dfs(i + 1);
                ans.pop_back();
            }
        };

        dfs(0);

        return ret;
    }
};

 

力扣131. 分割回文串

采用上述模板二，从答案的角度选择。选择隔板

class Solution {
public:
    vector<vector<string>> partition(string s) {
        int n = s.size();
        vector<vector<string> > ret;
        vector<string> ans;

        auto check = [&](int a, int b){
            for(int i = a, j = b; i < j; i++, j--){
                if(s[i] != s[j])    return false;
            }
            return true;
        };
        function<void(int)> dfs = [&](int i){
            if(i == n){
                ret.push_back(ans);
                return;
            }

            for(int j = i; j < n; j++){
                if(check(i, j)){
                    ans.push_back(s.substr(i, j - i + 1));
                    dfs(j + 1);
                    ans.pop_back();
                }
            }
        };

        dfs(0);
        return ret;
    }
};