题目：https://leetcode.com/problems/letter-combinations-of-a-phone-number/
代码(github)：https://github.com/illuz/leetcode
在手机上按字母，给出按的数字键，问所有的按的字母的情况。
DFS 过去是比较轻松的写法。
Files
Latest commit
This branch is up to date with illuz/leetcode:master.
017.Letter_Combinations_of_a_Phone_Number
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||