17. Letter Combinations of a Phone Number-优快云博客

本文介绍了一种基于电话按键映射实现的电话号码字母组合算法。通过递归深度优先搜索的方法，该算法能够生成所有可能的字母组合。文章提供了一个C++实现的例子，并详细展示了如何构造数字到字母的映射表以及如何利用DFS进行遍历。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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"].

class Solution {
public:
 
    string digit_lookuptable[10];
 

    vector<string> letterCombinations(string digits) {
        digit_lookuptable[0] = " ";        
        digit_lookuptable[1] = "OO";  
        digit_lookuptable[2] = "abc";
        digit_lookuptable[3] = "def";        
        digit_lookuptable[4] = "ghi";  
        digit_lookuptable[5] = "jkl";
        digit_lookuptable[6] = "mno";        
        digit_lookuptable[7] = "pqrs";  
        digit_lookuptable[8] = "tuv";
        digit_lookuptable[9] = "wxyz";
        
        vector<string>result;
        string ans;
        if(digits.size() == 0) return result;
        dfs(digits,0,ans,result);
        return result;
    }
    
    void dfs(string digits,int start,string &ans,vector<string>&result)
    {
       
        if(start == digits.size())
        {
            result.push_back(ans);
            return;
        }
        int curr_num = digits[start]-'0';
        for(int i = 0;i<digit_lookuptable[curr_num].size();i++)
         {
              ans = ans+digit_lookuptable[curr_num][i];
              dfs(digits,start+1,ans,result);
              ans.pop_back();
         }
    }
};