[LeetCode][Java] Letter Combinations of a Phone Number
2024-08-31 22:07:35
题目:
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.
题意:
给定一个数字字符串,返回这个数字能代表的全部的字母的组合。
数字对字母的映射例如以下图所看到的(就在电话的按键中)
Input:Digit string "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
返回的结果能够依照随意的顺序。
算法分析:
* 思路:
*比方“234”这个字符串,我能够先将0...1的全部排列找到-->{"a", "b", "c"}
*再进一步将0...2的全部排列找到-->{"ad", "ae","af", "bd", "be", "bf", "cd", "ce", "cf"}
*如此循环...直到字符串末尾。实现例如以下
AC代码:
public class Solution
{
public ArrayList<String> letterCombinations(String digits)
{
ArrayList<String> res=new ArrayList<String>();
String charmap[] = {"0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
if (digits.length()==0) return res;
res.add("");
for (int i = 0; i < digits.length(); i++)
{
ArrayList<String> tempres=new ArrayList<String>();
String chars = charmap[digits.charAt(i) - '0'];
for (int c = 0; c < chars.length();c++)
{
for (int j = 0; j < res.size();j++)
tempres.add(res.get(j)+chars.charAt(c));
}
res = tempres;
}
return res;
}
}
最新文章
- Redis学习笔记~常用命令总结
- 5 分钟上手 ECharts
- Spring Cloud介绍 Spring Cloud与Dubbo对比
- Python的面向对象2
- vuejs子组件向父组件传递数据
- Android实现自定义的相机
- MT【265】a+b,ab
- Hadoop:hdfs文件permission denied问题解析
- Debian/Ubuntu/Deepin下AndroidStudio2/3打开AVD模拟器无反应
- 深入理解volatile
- Android编程心得-在Assets文件夹中放入.sql文件实现创建SQlite表的操作
- Java网络通信方面,BIO、NIO、AIO、Netty
- Eclipse界面简介
- pycharm使用技巧 + 调试程序-12
- 2018.10.25 bzo1227: [SDOI2009]虔诚的墓主人(组合数学+扫描线+bit)
- Windows折腾之路 兼谈纯净强迫情节
- 《JavaWeb从入门到改行》JDBC经典秘方QueryRunner
- Codeforces Round #239 (Div. 1) 二项式差分
- 《转》python学习--基础下
- 《Apologize》歌曲