[LintCode] Letter Combinations of a Phone Number

最新推荐文章于 2022-05-09 18:47:38 发布

转载最新推荐文章于 2022-05-09 18:47:38 发布 · 66 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/lz87/p/7494036.html

本文介绍了一个用于将数字转换为对应字母组合的算法，包括实现细节、映射关系和示例应用。

Given a digit string excluded 01, 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.

Cellphone

Although the above answer is in lexicographical order, your answer could be in any order you want.

The order of letter combinations is dicated by the given digit string order. For the given example "23", any of 2's mapping{a, b, c} must appear before any of 3's mapping{d, e, f};

Thus line 18 picks one letter mapping of a digit, add it to the string buffer, then proceed to repeat the same process on the next digit. The output condition is that we've picked

one mapping for each digit.

 1 public class Solution {
 2     private HashMap<Character, List<Character>> maps;
 3     public List<String> letterCombinations(String digits) {
 4         List<String> combs = new ArrayList<String>();
 5         if(digits == null || digits.length() == 0) {
 6             return combs;
 7         }
 8         maps = createMapping();
 9         recurHelper(combs, new StringBuffer(), digits, 0);
10         return combs; 
11     }
12     private void recurHelper(List<String> combs, StringBuffer sb, String digits, int startIdx) {
13         if(startIdx == digits.length()) {
14             combs.add(sb.toString());
15             return;
16         }
17         List<Character> group = maps.get(digits.charAt(startIdx));
18         for(int j = 0; j < group.size(); j++) {
19             sb.append(group.get(j));
20             recurHelper(combs, sb, digits, startIdx + 1);
21             sb.deleteCharAt(sb.length() - 1);
22         }
23     }
24     private HashMap<Character, List<Character>> createMapping() {
25         HashMap<Character, List<Character>> maps = new HashMap<>();
26         char currChar = 'a';
27         for(char c = '2'; c <= '6'; c++) {
28             List<Character> list = new ArrayList<Character>();
29             for(int i = 0; i < 3; i++) {
30                 list.add(currChar);
31                 currChar++;
32             }
33             maps.put(c, list);
34         }
35         List<Character> list7 = new ArrayList<Character>();
36         for(int i = 0; i < 4; i++) {
37             list7.add(currChar);
38             currChar++;
39         }
40         maps.put('7', list7);
41         List<Character> list8 = new ArrayList<Character>();
42         for(int i = 0; i < 3; i++) {
43             list8.add(currChar);
44             currChar++;
45         }
46         maps.put('8', list8);
47         List<Character> list9 = new ArrayList<Character>();
48         for(int i = 0; i < 4; i++) {
49             list9.add(currChar);
50             currChar++;
51         }
52         maps.put('9', list9);
53         return maps;
54     }
55 }