算法训练营笔记day25|216. 组合总和 III、17. 电话号码的字母组合

最新推荐文章于 2024-07-18 10:23:21 发布

weixin_45662787

最新推荐文章于 2024-07-18 10:23:21 发布

阅读量53

点赞数

文章标签：算法深度优先 leetcode

本文链接：https://blog.csdn.net/weixin_45662787/article/details/129766198

版权

216. 组合总和 III

题目连接

笔记

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

17. 电话号码的字母组合

题目连接

笔记

class Solution {
public:
    vector<string> result;
    string tem;
    const string letterMap[10] = {
        "",
        "",
        "abc",
        "def",
        "ghi",
        "jkl",
        "mno",
        "pqrs",
        "tuv",
        "wxyz"
    };
    void dfs(string& digits, int index) {
        if (digits.size() == index) {
            result.push_back(tem);
            return;
        }
        string str = letterMap[digits[index] - '0'];
        for (int i = 0; i < str.size(); i++) {
            tem.push_back(str[i]);
            dfs(digits, index + 1);
            tem.pop_back();
        }
    }
    vector<string> letterCombinations(string digits) {
        if (digits.size() == 0) return result;
        dfs(digits, 0);
        return result;
    }
};