Day.19 | 77.组合 216.组合总和III 17.电话号码的字母组合

77.组合

要点：回溯算法的经典题目，把代码套路当公式一样背下来吧

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;

    void backtracking(int n, int k, int startIndex) {
        if (path.size() == k) {
            result.push_back(path);
            return;
        }
        for (int i = startIndex; i <= n - (k - path.size()) + 1; i++) {
            path.push_back(i);
            backtracking(n, k, i + 1);
            path.pop_back();
        }
    }

    vector<vector<int>> combine(int n, int k) {
        backtracking(n, k, 1);
        return result;
    }
};

216.组合总和III

要点：回溯公式套一下，剪枝部分的操作第一时间没想到

class Solution {
public:
    vector<vector<int>> result;
    vector<int> path;

    void backtracking(int k, int targetSum, int sum, int startIndex) {
        if (sum > targetSum) {
            return;
        }
        if (path.size() == k) {
            if (targetSum == sum) {
                result.push_back(path);
            }
            return;
        }
        for (int i = startIndex; i <= 9 - (k - path.size()) + 1; i++) {
            path.push_back(i);
            sum += i;
            backtracking(k, targetSum, sum, i + 1);
            sum -= i;
            path.pop_back();
        }
    }

    vector<vector<int>> combinationSum3(int k, int n) {
        backtracking(k, n, 0, 1);
        return result;
    }
};

17.电话号码的字母组合 

要点：需要有参数来表示树的深度，for循环横向遍历，递归纵向遍历

class Solution {
public:
    const string letterMap[10] = {
        "",     // 0
        "",     // 1
        "abc",  // 2
        "def",  // 3
        "ghi",  // 4
        "jkl",  // 5
        "mno",  // 6
        "pqrs", // 7
        "tuv",  // 8
        "wxyz", // 9
    };
    vector<string> result;
    string combine;
    void backtracking(string digits, int index) {
        if (combine.size() == digits.size()) {
            result.push_back(combine);
            return;
        }
        int digit = digits[index] - '0'; // 将index指向的数字转为int
        string letters = letterMap[digit];
        for (int i = 0; i < letters.size(); i++) {
            combine.push_back(letters[i]);
            backtracking(digits, index + 1);
            combine.pop_back();
        }
    }

    vector<string> letterCombinations(string digits) {
        if (digits.size() == 0) {
            return result;
        }
        backtracking(digits, 0);
        return result;
    }
};