[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"].

这道题有两种解法，一种递归，一种递推。这里java用递推算法，golang用递归算法。

java算法

public class Solution {
    static Map<Character,String> keyMap = new HashMap<Character,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");
        }};
    public List<String> letterCombinations(String digits) {
        List<String> list = new ArrayList<String>();
        List<String> preList = new ArrayList<String>();
        if(digits==null || digits.length() ==0 || digits.contains("1") || digits.contains("0")){
            return list;
        }
        for(int i=0;i<digits.length();i++){
            List<String> curList = new ArrayList<String>();
            String tmp = keyMap.get(digits.charAt(i));
            int m=0,n=0;
            if(i==0){
                for(n=0;n<tmp.length();n++){
                    curList.add(String.valueOf(tmp.charAt(n)));
                }
                preList = curList;
            }else{
                for(m=0;m<preList.size();m++){
                    for(n=0;n<tmp.length();n++){
                        curList.add(preList.get(m)+String.valueOf(tmp.charAt(n)));
                    }
                }
                preList=curList;
                
            }
        }
        return preList;
    }
    
}

golang算法

func letterCombinations(digits string) []string {
	if len(digits) == 0 || Contains(digits, "0") || Contains(digits, "1") {
		return []string{}
	}
	var keyMap map[string]string = map[string]string{"2": "abc", "3": "def", "4": "ghi", "5": "jkl", "6": "mno", "7": "pqrs", "8": "tuv", "9": "wxyz"}
	return letterCombination(digits, len(digits)-1, keyMap)
}
func letterCombination(digits string, index int, keyMap map[string]string) []string {
	var result []string = []string{}
	if index == 0 {
		valueStr := keyMap[digits[0:1]]
		for i := 0; i < len(valueStr); i++ {
			result = append(result, valueStr[i:i+1])
		}
		return result
	} else {
		var preResult []string = letterCombination(digits, index-1, keyMap)
		for _, tmp := range preResult {
			valueStr := keyMap[digits[index:index+1]]
			for j := 0; j < len(valueStr); j++ {
				result = append(result, tmp+valueStr[j:j+1])
			}
		}
		return result
	}
}
func Contains(source, target string) bool {
	for i := 0; i < len(source); i++ {
		if source[i:i+1] == target {
			return true
		}
	}
	return false
}