代码随想录算法训练营day29| 216.组合总和III，17.电话号码的字母组合

day25-28 休息

216.组合总和III

216. 组合总和 III

class Solution {
public:
    vector<vector<int>> ans;
    vector<int> path;
    int sum = 0;
    void backtracking(int n, int k, int startindex){
        if(path.size() == k){
            if(sum == n)ans.push_back(path);
            return;
        }

        for(int i=startindex; i<=9; i++){
            path.push_back(i);
            sum += i;
            backtracking(n, k, i+1);
            sum -= i;
            path.pop_back();
        }
    }
    vector<vector<int>> combinationSum3(int k, int n) {
        backtracking(n, k, 1);
        return ans;
    }
};

17.电话号码的字母组合

17. 电话号码的字母组合

建立数组存放数字与字母的映射关系

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> ans;
    string path;
    void backtracking(const string& digits, int startindex){
        if(path.size() == digits.size()){
            ans.push_back(path);
            return;
        }
        int digit = digits[startindex] - '0';
        string letters = letterMap[digit];
        for(int i=0; i<letters.size(); i++){
            path.push_back(letters[i]);
            backtracking(digits, startindex+1);
            path.pop_back();
        }
    }
    vector<string> letterCombinations(string digits) {
        if(digits.size() == 0) return ans;
        backtracking(digits, 0);
        return ans;
    }
};