代码随想录算法训练营第二十五天 |LC 216. 组合总和 III、LC 17. 电话号码的字母组合

216. 组合总和 III

思路

组合，不重复数字

1. 截止条件：path中数字和满足
2. 遍历循环：从1到9循环
3. 剪枝：当sum已经大于n就返回，当循环不满足能放入的个数

代码

class Solution {
public:
    vector<vector<int>> res;
    vector<int> path;
    vector<vector<int>> combinationSum3(int k, int n) {
        backtracking(k, n, 0, 1);
        return res;
    }
    void backtracking(int k, int n, int sum, int startIndex){
        if (sum > n) return;
        if (path.size() == k){
            if (sum == n) res.push_back(path);
            return;
        }
        for (int i = startIndex; i <= 9 - (k - path.size()) + 1; i ++){
            path.push_back(i);
            sum += i;
            backtracking(k, n, sum, i + 1);
            sum -= i;
            path.pop_back();
        }
    }
};

17. 电话号码的字母组合

思路

组合，不重复

1. 截止条件：path长度符合
2. 单层递归：对应的那个数字所包含字母放进去

代码

class Solution {
public:
    vector<string> num2alpha = {
        "", "","abc", "def",
        "ghi", "jkl", "mno",
        "pqrs", "tuv", "wxyz"
    };
    vector<string> res;
    string path = "";
    vector<string> letterCombinations(string digits) {
        if (digits.size() == 0) return res;
        backtracking(digits, 0);
        return res;
    }
    void backtracking(string digits, int startIndex){
        if (path.size() == digits.size()){
            res.push_back(path);
            return;
        }
        for (int i = 0; i < num2alpha[digits[startIndex] - '0'].size(); i ++){
            path.push_back(num2alpha[digits[startIndex] - '0'][i]);
            backtracking(digits, startIndex + 1);
            path.pop_back();
        }
    }
};