【LeetCode】17.Letter Combinations of a Phone Number(medium)解题报告
题目地址:https://leetcode.com/problems/letter-combinations-of-a-phone-number/description/
题目描述:
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.
Solution1:
//time:O(3^n)
//space:O(n)
class Solution {
String[] mapping = new String[]{"0","1","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
public List<String> letterCombinations(String digits) {
List<String> res = new ArrayList<>();
if(digits.length()==0 || digits==null) return res;
helper(res,digits,"",0);
return res;
}
public void helper(List<String> res,String digits,String s,int index){
if(index==digits.length()){
res.add(s);
return;
}
String letters = mapping[digits.charAt(index) - '0'];
for(int i=0;i<letters.length();i++){
helper(res,digits,s+letters.charAt(i),index+1);
}
}
}
solution2:
//for循环,此法只适用这道题,看看就好
class Solution {
public List<String> letterCombinations(String digits) {
LinkedList<String> res = new LinkedList<>();
if(digits.length()==0 || digits==null) return res;
String[] mapping = new String[]{"0","1","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
res.add("");
for(int i=0;i<digits.length();i++){
int num = digits.charAt(i) - '0';
while(res.peek().length()==i){
String t = res.remove();
for(char s : mapping[num].toCharArray()){
res.add(t+s);
}
}
}
return res;
}
}
Date:2018年1月13日