LeeMax117 / LeetCode_practise

recorde our Leetcode process
0 stars 1 forks source link

17: Letter Combinations #4

Closed LeeMax117 closed 5 years ago

LeeMax117 commented 5 years ago

给定一个仅包含数字 2-9 的字符串,返回所有它能表示的字母组合。

给出数字到字母的映射如下(与电话按键相同)。注意 1 不对应任何字母。

示例:

输入:"23" 输出:["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].

说明: 尽管上面的答案是按字典序排列的,但是你可以任意选择答案输出的顺序。

nijilong1224 commented 5 years ago

https://github.com/LeeMax117/LeetCode_practise/blob/master/Jinglong/letterCombinations.py

LeeMax117 commented 5 years ago

https://github.com/LeeMax117/LeetCode_practise/blob/master/LeeMax/17_Letter_combination.py