LeetCode 134 Letter Combinations of a Phone Number

最新推荐文章于 2025-01-13 10:13:28 发布

原创最新推荐文章于 2025-01-13 10:13:28 发布 · 703 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#LeetCode #Letter Combinations

LeetCode 专栏收录该内容

151 篇文章

订阅专栏

本文详细阐述了如何使用回溯法（深度优先搜索）来解决数字到字母组合的问题，通过给定的数字字符串，生成所有可能的字母组合。

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

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.

分析：

看到返回所有，应该想到回溯，即DFS。

public class Solution {
    public List<String> letterCombinations(String digits) {
        //存候选
        String[] ss = {" ", "", "abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
        List<String> res = new ArrayList<String>();
        dfs(res, digits.length(), ss, digits, new StringBuffer());
        return res;
    }
    
    public void dfs(List<String> res, int remain, String[] ss, String digits, StringBuffer sb){
        if(remain==0){
            res.add(sb.toString());
            return;
        }
        String s = ss[digits.charAt(0)-'0'];
        //对所有情况进行处理
        for(int i=0; i<s.length(); i++){
            sb.append(s.charAt(i));
            dfs(res, remain-1, ss, digits.substring(1), sb);
            sb.deleteCharAt(sb.length()-1);
        }
    }
}