leetcode 17. 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.

给定一个数字字符串,返回所有可能代表的字母组合. 每个数字代表的字母如图.

public class A17LetterCombinationsofaPhoneNumber {
    public List<String> letterCombinations(String digits) {
		List<String> list = new ArrayList<String>();
		if(digits == null || "".equals(digits)) return list;
		char[][] nums = { {}, {}, 
				{ 'a', 'b', 'c' }, 
				{ 'd', 'e', 'f' },
				{ 'g', 'h', 'i' }, 
				{ 'j', 'k', 'l' }, 
				{ 'm', 'n', 'o' },
				{ 'p', 'q', 'r', 's' }, 
				{ 't', 'u', 'v' },
				{ 'w', 'x', 'y', 'z' } };
		list.add("");
		for(int i = digits.length() - 1; i >= 0 ; i--) {
			int n = digits.charAt(i) - '0';
			if(n > 1 && n <= 9) {
				List<String> tmp = new ArrayList<String>();
				for(int j = 0; j < nums[n].length; j++) {
					for(int k = 0; k < list.size(); k++) {
						tmp.add(nums[n][j] + list.get(k));
					}
				}
				list = tmp;
			}
		}
		return list;
	}
}