【leetcode】String——Letter Combinations of a Phone Number （17）

最新推荐文章于 2020-10-13 06:37:16 发布

永不_言败

最新推荐文章于 2020-10-13 06:37:16 发布

阅读量334

点赞数

分类专栏： leetcode-string

本文链接：https://blog.csdn.net/u013127687/article/details/51180350

版权

leetcode-string 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

题目：

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

思路1：暴力循环，需要两个List re和tmp，每次从re取出之前的结果，加上当前字符，放入tmp，然后清除re，再allAll(tmp)

代码1：

public List<String> letterCombinations(String digits) {
	String[]phoneMap = {"","","abc","def","ghi","jlk","mno","pqrs","tuv","wxyz"};
	List<String> re = new LinkedList<String>();
	List<String> tmp = new ArrayList<String>();
	for(char number : digits.toCharArray()){
		int index = Character.getNumericValue(number);
		String letters = phoneMap[index];
		for(char letter : letters.toCharArray()){
			for(String ss : re){
				tmp.add(ss+letter);
			}
			if(re.isEmpty()){
				tmp.add(""+letter);
			}
		}
		re.clear();
		re.addAll(tmp);
		tmp.clear();
	}
	return re;
}

思路2：FIFO 不需要两个List，直接从re取出，加上当前字符，加入队尾。直到peek（获取对头元素，但不删除）到的元素长度!= i .

代码2：

public List<String> letterCombinations(String digits) {
    LinkedList<String> ans = new LinkedList<String>();
    String[] mapping = new String[] {"0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
    ans.add("");
    for(int i =0; i<digits.length();i++){
        int x = Character.getNumericValue(digits.charAt(i));
        while(ans.peek().length()==i){ //精华所在
            String t = ans.remove();
            for(char s : mapping[x].toCharArray())
                ans.add(t+s);
        }
    }
    return ans;
}

除此之外还可以用DFS