算法训练营Day19

算法训练营Day19

算法训练营Day19

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

题目

77.组合

题目链接：https://leetcode.cn/problems/combinations/description/
文章讲解：https://programmercarl.com/0077.%E7%BB%84%E5%90%88.html

思路

注意回溯，可以剪枝，有点像深搜的写法

代码

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

216.组合总和III

题目链接：https://leetcode.cn/problems/combination-sum-iii/description/
文章讲解：https://programmercarl.com/0216.%E7%BB%84%E5%90%88%E6%80%BB%E5%92%8CIII.html

思路

同上一题

代码

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

17. 电话号码的字母组合

题目链接：https://leetcode.cn/problems/letter-combinations-of-a-phone-number/description/
文章讲解：https://programmercarl.com/0017.%E7%94%B5%E8%AF%9D%E5%8F%B7%E7%A0%81%E7%9A%84%E5%AD%97%E6%AF%8D%E7%BB%84%E5%90%88.html

思路

思路和上面两题略有差别，这个每层都在不同的集合中选择数字，前两题每层都在相同集合中选择，所以要注意不能重复
注意数字的映射

代码

class Solution {
public:
    const string letterMap[10] = {
        "","","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(1, digits);
        return res;
    }
    void backtracking(int index, string &digits){
        if(index > digits.size()){
            res.push_back(path);
            return;
        }
        int num = digits[index - 1] - '0';
        for(int i = 0; i < letterMap[num].size(); i ++){
            path.push_back(letterMap[num][i]);
            backtracking(index + 1, digits);
            path.pop_back();
        }
    }
};