Letter Combinations of a Phone Number
2015-09-12 17:20
260 查看
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.
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.
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Word Ladder
- 使用 awk 命令行快速分析HTTP Server 访问日志
- C# - Recommendations for Abstract Classes vs. Interfaces
- UFLDL 教程学习笔记（三）
- gitlab安装
- cocos2dx环境和相关命令
- Java设计模式——代理模式
- Permutations
- Permutations II
- Combinations
- C语言：二叉树的相关操作
- 黑马程序员——IO流(上)
- codeforces 505B B. Mr. Kitayuta's Colorful Graph(bfs)
- 内核调试
- 最长递增子序列的nlog(n)算法
- 黑马程序员—Java基础—字符、随机数、包、for循环
- hibernate映射文件之<set>
- Subsets
- Subsets II
- Spark1.0.2 Standalone 模式部署