# LeetCode17:Letter Combinations of a Phone Number

678人阅读 评论(0)

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.

runtime:0ms

class Solution {
public:
vector<string> letterCombinations(string digits) {
vector<string> result;
if(digits.size()==0)
return result;
string nums[]={" ","00","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
string path;
helper(digits,0,path,result,nums);
return result;

}

void helper(string digits,int pos,string &path,vector<string> &result,string * nums)
{
if(pos==digits.size())
{
result.push_back(path);
return ;
}
string tmp=nums[digits[pos]-'0'];
for(int i=0;i<tmp.size();i++)
{
path=path+tmp[i];
helper(digits,pos+1,path,result,nums);
path=path.substr(0,path.size()-1);
}
}
};
0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：335551次
• 积分：6178
• 等级：
• 排名：第4162名
• 原创：261篇
• 转载：43篇
• 译文：13篇
• 评论：43条
友情链接
博客专栏
 设计模式（C++） 文章：24篇 阅读：16566
 LeetCode 文章：94篇 阅读：66443
 openGL系列教程 文章：13篇 阅读：27903
文章分类
评论排行
最新评论