LeetCode17:Letter Combinations of a Phone Number

原创 2015年07月07日 16:50:00

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.

这明显的一道回溯法的题,使用深度优先遍历每个数字可能对应的字符,每遍历完一个字符回溯回下一个字符。使用一个字符串记录可能的路径,找到递归退出的条件是遍历完字符串。唯一要注意的一点是数字到字符之间的映射使用map< int ,string >可以实现,但是直接使用string[]也可以实现。
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);
        }
    }
};

相关文章推荐

leetcode 17. Letter Combinations of a Phone Number

题意 给定一个数字字符串,枚举各个数字对应的字母组合后的字符串(不重复)。 题解 一个串中字母的重复次数,即后面字母形成串的可能种数。 给定数字”234”,对应串“abc”、“def”、...

[Java]LeetCode17 Letter Combinations of a Phone Number

[Java]LeetCode17 Letter Combinations of a Phone Number
  • fumier
  • fumier
  • 2015年04月24日 09:47
  • 877

LeetCode OJ-17-Letter Combinations of a Phone Number

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

LeetCode OJ-17.Letter Combinations of a Phone Number(DFS)

LeetCode OJ-17.Letter Combinations of a Phone Number(DFS解法)题目描述 Given a digit string, return all p...

LeetCode#17 Letter Combinations of a Phone Number

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

LeetCode-17.Letter Combinations of a Phone Number

https://leetcode.com/problems/letter-combinations-of-a-phone-number/ Given a digit string, retu...

LeetCode 17 Letter Combinations of a Phone Number(C,C++,Java,Python)

Problem: Given a digit string, return all possible letter combinations that the number could re...

LeetCode 17 Letter Combinations of a Phone Number(电话号码的字母组合)

翻译给定一个数字字符串,返回所有这些数字可以表示的字母组合。一个数字到字母的映射(就像电话按钮)如下图所示。输入:数字字符串“23” 输出:["ad", "ae", "af", "bd", "be",...
  • NoMasp
  • NoMasp
  • 2015年10月18日 10:59
  • 3356

leetcode(17):Letter Combinations of a Phone Number

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

leetcode:17. Letter Combinations of a Phone Number

leetcode 17. Letter Combinations of a Phone Number. 座右铭:越努力,越幸运
  • Earl211
  • Earl211
  • 2017年03月09日 11:25
  • 125
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:LeetCode17:Letter Combinations of a Phone Number
举报原因:
原因补充:

(最多只允许输入30个字)