代码随想录第二十五天|216.组合总和 III，17电话号码的字母组合

216. 组合总和 III - 力扣（Leetcode）

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

17. 电话号码的字母组合 - 力扣（Leetcode） 

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