zoukankan      html  css  js  c++  java
  • [leetcode]17. Letter Combinations of a Phone Number手机键盘的字母组合

    Given a string containing digits from 2-9 inclusive, 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. Note that 1 does not map to any letters.

    Example:

    Input: "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.

    题意:

    给定一个数字串,看看有多少种对应的字母串。

    思路:

    Assumption:

    字符串的合法性,是否包含1这个数字?如果包含,怎么处理?同样,输入是否考虑 * 或 #?

    空字符串怎么处理?

    多个解按什么顺序返回?

    High Level带着面试官walk through:

    take "23" for example:

    when index = 0,  pointing to '2' in "23"

    String letters  =  "abc"

    for each char in letters,

    add to path 

    move index forward, pointing to '3' in "23",  recursively call the helper function to add every char of "def" to the path

     

    code

     1 class Solution {
     2     private static String[] keyboard =
     3             new String[]{ " ", "", "abc", "def", // '0','1','2',...'9'
     4             "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" };
     5     
     6     public List<String> letterCombinations(String digits) { //"23"
     7         List<String> result = new ArrayList<>();
     8         if(digits.length() == 0 ) return result;
     9         helper(digits, 0, new StringBuilder(), result);
    10         return result;    
    11     }
    12     
    13     private void helper(String digits, int index, StringBuilder sb, List<String> result){
    14         if(index == digits.length()){
    15             result.add(sb.toString());
    16             return;
    17         }   
    18         String letters = keyboard[digits.charAt(index) - '0']; 
    19         for(int i = 0;  i < letters.length(); i++ ){
    20             char c = letters.charAt(i);
    21             sb.append(c);
    22             helper(digits, index+1, sb, result);
    23             sb.deleteCharAt(sb.length() - 1);
    24         }
    25     }
    26 }

    注意: 这个题也可以用String path来存每条路径。 可是我自己觉得用StringBuilder这么动态伸缩,更显得有“Backtracking”的味道。 

  • 相关阅读:
    linux学习-----项目上线步骤
    linux学习-----数据库MySQL
    linux学习-----shell基础
    linux学习-----网络基础,网络相关命令,项目上线流程
    linux学习-----linux权限,sudo的使用
    linux学习-----开机启动项设置,ntp服务,防火墙服务,rpm服务,cron服务
    linux学习-----用户,用户组管理 网络设置 ssh服务
    linux学习-----vim编辑器的使用
    linux学习-----指令学习2 及练习
    linux学习-----指令学习1
  • 原文地址:https://www.cnblogs.com/liuliu5151/p/9189741.html
Copyright © 2011-2022 走看看