电话号码的字母组合

给定一个仅包含数字 2-9 的字符串，返回所有它能表示的字母组合。
给出数字到字母的映射如下（与电话按键相同）。注意 1 不对应任何字母。

示例:
输入：“23”
输出：[“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”].
1.Java回溯

class Solution {
  Map<String, String> phone = new HashMap<String, String>() {{
    put("2", "abc");
    put("3", "def");
    put("4", "ghi");
    put("5", "jkl");
    put("6", "mno");
    put("7", "pqrs");
    put("8", "tuv");
    put("9", "wxyz");
  }};

  List<String> output = new ArrayList<String>();

  public void backtrack(String combination, String next_digits) {
    // if there is no more digits to check
    if (next_digits.length() == 0) {
      // the combination is done
      output.add(combination);
    }
    // if there are still digits to check
    else {
      // iterate over all letters which map 
      // the next available digit
      String digit = next_digits.substring(0, 1);
      String letters = phone.get(digit);
      for (int i = 0; i < letters.length(); i++) {
        String letter = phone.get(digit).substring(i, i + 1);
        // append the current letter to the combination
        // and proceed to the next digits
        backtrack(combination + letter, next_digits.substring(1));
      }
    }
  }

  public List<String> letterCombinations(String digits) {
    if (digits.length() != 0)
      backtrack("", digits);
    return output;
  }
}

2.C#
可以将字母组合视为一个进制比较特别的数字。计算数字的范围，然后根据特殊进制规则，翻译结果。比如：“23”是两位3进制(“a|b|c”“d|e|f”)的数字，值域为【0-8】共9个数字。注意：位数较长时，有溢出风险。可以用该思路将字符串映射到数字，如在数据库设计中以整型替代字符串作为主键，提高检索效率。

public class Solution {
    const char BaseChar = '2';
    static readonly string[] Phone = new string[] {"abc" ,"def" ,"ghi" ,"jkl" ,"mno" ,"pqrs","tuv" ,"wxyz"};

    public IList<string> LetterCombinations(string digits)
    {
        var digitArray = digits.ToCharArray();
        var wordsCount = digitArray.Length == 0 ? 0 : 1;
        var baseNum = new int[digitArray.Length];
        // for (int i = 0; i < digitArray.Length; i++)
        for (int i = digitArray.Length - 1; i >= 0; i--)
        {
            baseNum[i] = wordsCount;
            wordsCount *= Phone[digitArray[i] - BaseChar].Length;
        }
        var result = new List<string>(wordsCount);            
        var word = new char[digitArray.Length];
        for (int num = 0; num < wordsCount; num++)
        {
            for (int i = 0; i < digitArray.Length; i++)
            {
                var letters = Phone[digitArray[i] - BaseChar];
                word[i] = letters[num / baseNum[i] % letters.Length];
            }
            result.Add(new string(word));
        }
        return result;
    }
}