leetcode-Letter Combinations of a Phone Number

最新推荐文章于 2014-07-16 21:47:33 发布

原创最新推荐文章于 2014-07-16 21:47:33 发布 · 384 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

71 篇文章

订阅专栏

本文介绍了一种使用深度优先搜索(DFS)算法来生成电话号码所有可能的字母组合的方法。通过递归的方式，从电话按键对应的字母中选择每个数字对应的字母进行组合。

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

Note:
Although the above answer is in lexicographical order, your answer could be in any order you want.

思路：DFS（参考其他人的思路才解决的。。。）

代码：

void DFS(string digits,string str,int dep,vector<string> &res,string *maptable)
{
if(dep == digits.length())
{
res.push_back(str);
return;
}
for(int i=0; i<maptable[digits[dep]-'0'].length();++i)
{
string temp=str;
temp+=maptable[digits[dep]-'0'][i];
DFS(digits,temp,dep+1,res,maptable);
}
}
vector<string> letterCombinations(string digits)
{
string maptable[]={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
string str="";
vector<string> res;

DFS(digits,str,0,res,maptable);
return res;
}