【LeetCode】017. Letter Combinations of a Phone Number

最新推荐文章于 2025-09-12 17:31:31 发布

转载最新推荐文章于 2025-09-12 17:31:31 发布 · 47 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Atanisi/p/6786345.html

文章标签：

#数据结构与算法

本文介绍了一种解决电话号码对应字母组合问题的算法实现。通过深度优先搜索(DFS)递归方法，根据电话按键上字母与数字的映射关系，生成所有可能的字母组合。该文提供了一个C++实现的具体示例。

题目：

Given a digit string, return all possible letter combinations that the number could represent.

A mapping of digit to letters (just like on the telephone buttons) is given below.

Input:Digit string "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

题解：

Solution 1 ()

class Solution {
public: 
    void dfs(string digits, int level, vector<string>& vv, string& s, vector<string> dict){
        if(level >= digits.size()) {
            vv.push_back(s);
            return;
        }
        string tmp = dict[digits[level] - '2'];
        for(int i=0; i<tmp.size(); ++i) {
            s.push_back(tmp[i]);
            dfs(digits, level+1, vv, s, dict);
            s.pop_back();
        }
    }
    vector<string> letterCombinations(string digits) {
        if(digits.empty()) return vector<string>();
        vector<string> dict = {"abc","def","ghi","jkl",
                                "mno","pqrs","tuv","wxyz"};
        vector<string> vv;
        string s;
        dfs(digits, 0, vv, s, dict);
        return vv;                
    }
};