代码随想录D25

qq_21609915

已于 2024-04-27 14:51:26 修改

阅读量203

点赞数 2

文章标签：算法开发语言

于 2024-04-27 14:35:31 首次发布

本文链接：https://blog.csdn.net/qq_21609915/article/details/138247895

版权

本文介绍了在LeetCode中解决的两个问题，分别是使用回溯算法的216.组合总和III和17.电话号码的字母组合，通过backtracking方法实现求解。

摘要由CSDN通过智能技术生成

216.组合总和III

题目链接/文章讲解：代码随想录

视频讲解：和组合问题有啥区别？回溯算法如何剪枝？| LeetCode：216.组合总和III_哔哩哔哩_bilibili

class Solution {
private:
    vector<int> set;
    vector<vector<int>> result;
    int startIndex = 1;
    int sum = 0;
public:
    vector<vector<int>> combinationSum3(int k, int n) {
        if(k * (k + 1) / 2 > n) return {};
        backtracking(k, n, 1, k);
        return result;
        
    }

    void backtracking(int k, int n, int startIndex, int count){
        if(set.size() == k){
            if(sum == n) result.push_back(set);
            return;
        }

        for(int i = startIndex; i <= 10 - count; i++){
            set.push_back(i);
            sum += i;
            backtracking(k, n, i + 1, count - 1);
            set.pop_back();
            sum -= i;
        }
    }
};

17.电话号码的字母组合

题目链接/文章讲解：代码随想录

视频讲解：还得用回溯算法！| LeetCode：17.电话号码的字母组合_哔哩哔哩_bilibili

class Solution {
private:
    unordered_map<int, string> hash;
    string set;
    vector<string> result;

public:
    vector<string> letterCombinations(string digits) {
        if(digits.empty()) return{};
        hash[2] = "abc";
        hash[3] = "def";
        hash[4] = "ghi";
        hash[5] = "jkl";
        hash[6] = "mno";
        hash[7] = "pqrs";
        hash[8] = "tuv";
        hash[9] = "wxyz";
        backtracking(digits, 0);
        return result;
    }

    void backtracking(const string &digits, int startIndex){
        if(set.length() == digits.length()){
            result.push_back(set);
            return;
        }

        string str = hash.find((int)(digits[startIndex] - '0'))->second;

        for(char s : str){
            set += s;
            backtracking(digits, startIndex + 1);
            set.pop_back();
        }
    }
};