国内最全IT社区平台 联系我们 | 收藏本站
华晨云阿里云优惠2
您当前位置:首页 > php开源 > php教程 > Letter Combinations of a Phone Number

Letter Combinations of a Phone Number

来源:程序员人生   发布时间:2015-04-08 08:36:06 阅读次数:2406次

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解决

class Solution { public: vector<string> letterCombinations(string digits) { vector<string>ans; dfs(digits,0,"",ans); return ans; } void dfs(string digits, int start, string s, vector<string>&ans){ if(start == digits.size()){ if(s != "") ans.push_back(s); return; } int cnt = digits[start]-'2'; for(int i = 0; i < 4; i++) if(letter[cnt][i] != '!') dfs(digits, start+1,s+letter[cnt][i],ans); } char letter[8][4] = { {'a', 'b', 'c', '!'}, {'d', 'e', 'f', '!'}, {'g', 'h', 'i', '!'}, {'j', 'k', 'l', '!'}, {'m', 'n', 'o', '!'}, {'p', 'q', 'r', 's'}, {'t', 'u', 'v', '!'}, {'w', 'x', 'y', 'z'} }; };


生活不易,码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠
程序员人生
------分隔线----------------------------
分享到:
------分隔线----------------------------
关闭
程序员人生