leetcode打卡#day28 emmm 模版题 216. 组合总和 III、17. 电话号码的字母组合

216. 组合总和 III

class Solution {
public:
    vector<int> path;
    vector<vector<int>> ans;
    void backTracking(int targetSum, int k,int sum,int startIndex){
        //剪枝op
        if (sum > targetSum) return;
        //终止条件
        if (path.size() == k){
            if (targetSum == sum) ans.push_back(path);
            return;
        }
        //每次层的循环
        for (int i = startIndex; i <= 9-k+path.size()+1; ++i) {
            path.push_back(i);
            sum += i;
            backTracking(targetSum, k, sum, i+1);
            //回溯op
            sum -= i;
            path.pop_back();
        }
    }
    vector<vector<int>> combinationSum3(int k, int n) {
        backTracking(n, k, 0, 1);
        return ans;
    }
};

17. 电话号码的字母组合

//多个数组
class Solution {
private:
    const string letterMap[10] = {
        //对应号码
        "",
        "",
        "abc",
        "def",
        "ghi",
        "jkl",
        "mno",
        "pqrs",
        "tuv",
        "wxyz"
    };
    //注意，这里是多个数组
    vector<string> result;
    string s;
    void backtracking(const string& digits, int index) {
        if (index == digits.size()) {
            //收获结果
            result.push_back(s);
            return;
        }
        //index表示输入的字符的第几个下标
        int digit = digits[index] - '0';
        const string letter = letterMap[digit];
        //注意这里与1个数组的区别
        for (int i = 0; i < letter.size(); i++) {
            s.push_back(letter[i]);
            backtracking(digits, index+1);
            s.pop_back();
        }
    }
public:
    vector<string> letterCombinations(string digits) {
        if (digits.size() == 0) return result;
        backtracking(digits, 0);
        return result;
    }
};