[LeetCode] Letter Combinations of a Phone Number

最新推荐文章于 2020-08-10 10:20:18 发布

a83610312

最新推荐文章于 2020-08-10 10:20:18 发布

阅读量645

点赞数

CC 4.0 BY-SA版权

分类专栏： LeetCode

本文链接：https://blog.youkuaiyun.com/a83610312/article/details/9570383

LeetCode 专栏收录该内容

74 篇文章

订阅专栏

本文介绍了一种算法，该算法接收一个数字字符串，并返回所有可能的字母组合，这些组合对应于输入数字在电话键盘上的映射。例如，对于输入'23'，输出包括['ad','ae','af','bd','be','bf','cd','ce','cf']等。

Letter Combinations of a Phone Number:

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.

class Solution {
public:
    vector<string> letterCombinations(string digits) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int n=digits.length();
        vector<string> ans;
        string tmp;
        vector<string> trans;
        trans.push_back(string(" "));
        trans.push_back(string(""));
        trans.push_back(string("abc"));
        trans.push_back(string("def"));
        trans.push_back(string("ghi"));
        trans.push_back(string("jkl"));
        trans.push_back(string("mno"));
        trans.push_back(string("pqrs"));
        trans.push_back(string("tuv"));
        trans.push_back(string("wxyz"));
        solve(ans,trans,tmp,digits,0,n);
        return ans;
    }
    void solve(vector<string>& ans,vector<string>& trans,string& tmp,string& digits,int k,int n)
    {
        if ( k==n )
        {
            ans.push_back(tmp);
            return;
        }
        int p=digits[k]-'0';
        int sz=trans[ p ].length();
        for(int i=0;i<sz;i++)
        {
            tmp.push_back(trans[p][i]);
            solve(ans,trans,tmp,digits,k+1,n);
            tmp.pop_back();
        }
    }
};