Letter Combinations of a Phone Number

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.

Have you been asked this question in an interview? 
这道题目是combination 的题目，同样也是dfs。
这里要出注意几个细节：
1 digit 为null 的时候，返回的是空数组； digit 为“”的时候 返回的是［“”］。两种返回结果是不一样的。
2 stringbuilder 的 tostring 方法 返回的是 A new  String  object，而不是将stringbuilder 转换为string， 所以在将结果集存入res时，不需要重新new。
3 要熟悉stringbuilder 的几个常用方法：toString(); charAt(); append(); deleteCharAt()

public class Solution {
    public List<String> letterCombinations(String digits) {
        List<String> res = new ArrayList<String>();
        if (digits == null) {
            return res;
        }
        Map<Character,char[]> map = new HashMap<Character, char[]>();
        map.put('1',new char[]{});
        map.put('2',new char[]{'a','b','c'});
        map.put('3',new char[]{'d','e','f'});
        map.put('4',new char[]{'g','h','i'});
        map.put('5',new char[]{'j','k','l'});
        map.put('6',new char[]{'m','n','o'});
        map.put('7',new char[]{'p','q','r','s'});
        map.put('8',new char[]{'t','u','v'});
        map.put('9',new char[]{'w','x','y','z'});
        map.put('0',new char[]{});
        StringBuilder s = new StringBuilder();
        helper(digits, 0, res, s, map);
        return res;
        
    }
    private void helper(String digits, int start, List<String> res, StringBuilder s, Map<Character,char[]> map) {
        if (s.length() == digits.length()) {
            res.add(s.toString());
            return;
        }
        char[] cur = map.get(digits.charAt(start));
        for (int i = 0; i < cur.length; i++) {
            s.append(cur[i]);
            helper(digits, start + 1, res, s, map);
            s.deleteCharAt(s.length() - 1);
        }
        return;
    }
}