LeetCode:Letter Combinations of a Phone Number

最新推荐文章于 2020-06-29 06:01:11 发布

原创最新推荐文章于 2020-06-29 06:01:11 发布 · 2.6k 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode OJ 同时被 2 个专栏收录

216 篇文章

订阅专栏

LeetCode解题记录

216 篇文章

订阅专栏

本文介绍了一种算法，该算法能够根据电话按键上数字到字母的映射，输入一个数字字符串并返回所有可能的字母组合。例如，对于输入23，输出包括[adaeafbdbebfcdcecf]等。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Letter Combinations of a Phone Number

Total Accepted: 81548 Total Submissions: 280640 Difficulty: Medium

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.

Subscribe to see which companies asked this question

Hide Tags

Backtracking String

Hide Similar Problems

(M) Generate Parentheses (M) Combination Sum

java code:

public class Solution {
    public List<String> letterCombinations(String digits) {
        
        String[] mappings = {"0","1","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
        
        LinkedList<String> ans = new LinkedList<String>();
        if(digits.length() == 0) return ans;
        ans.add("");
        
        for(int i=0;i<digits.length();i++) {
            int num = digits.charAt(i)-'0';
            while(ans.peek().length() == i) {
                String t = ans.remove();
                for(char c : mappings[num].toCharArray()) {
                    ans.add(t+c);
                }
            }
        }
        return ans;
    }
}