17. Letter Combinations of a Phone Number( 电话号码的字母组合)

17. Letter Combinations of a Phone Number( 电话号码的字母组合)

暴力解法

public static List<String> letterCombinations(String digits) {
    if (digits.isEmpty()) {
      return new ArrayList<>();
    }
    char[] numbers = digits.toCharArray();
    Map<Character, String> map = new HashMap<>();
    map.put('2', "abc");
    map.put('3', "def");
    map.put('4', "ghi");
    map.put('5', "jkl");
    map.put('6', "mno");
    map.put('7', "pqrs");
    map.put('8', "tuv");
    map.put('9', "wxyz");
    List<String> help = new ArrayList<>();
    List<String> result = new ArrayList<>();
    for (int i = 0; i < map.get(numbers[0]).length(); i++) {
      help.add(map.get(numbers[0]).charAt(i) + "");
    }
    for (int i = 1; i < numbers.length; i++) {
      char[] chars = map.get(numbers[i]).toCharArray();
      for (int j = 0; j < help.size(); j++) {
        for (int k = 0; k < chars.length; k++) {
          result.add(help.get(j) + chars[k]);
        }
      }
      help.clear();
      help.addAll(result);
      result.clear();
    }
    return help;
  }

DFS 回溯
大佬就是给力,速度快的一笔

class Solution {

public static Map<Character, String> map = new HashMap<>();
public static StringBuilder current = new StringBuilder();
public static List<String> result = new ArrayList<>();

public static void DFS(int index, String digits) {
  if (index == digits.length()) {
    result.add(current.toString());
    return;
  }

  for (int i = 0; i < map.get(digits.charAt(index)).length(); i++) {
    current.append(map.get(digits.charAt(index)).charAt(i));
    DFS(index + 1, digits);
    current.deleteCharAt(current.length() - 1);
  }
}

public List<String> letterCombinations(String digits) {
  result.clear();
  if (digits.isEmpty()) {
    return new ArrayList<>();
  }
  map.put('2', "abc");
  map.put('3', "def");
  map.put('4', "ghi");
  map.put('5', "jkl");
  map.put('6', "mno");
  map.put('7', "pqrs");
  map.put('8', "tuv");
  map.put('9', "wxyz");
  DFS(0, digits);
  return result;
}
}