Letter Combinations of a Phone Number

最新推荐文章于 2025-07-20 11:42:00 发布

最新推荐文章于 2025-07-20 11:42:00 发布 · 83 阅读

leetcode 专栏收录该内容

193 篇文章

订阅专栏

本文介绍了一种将数字字符串转换为对应字母组合的方法，通过预定义的按键映射实现，适用于电话号码或其他数字编码场景。

摘要生成于 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.

public class Solution {
    public List<String> letterCombinations(String digits) {
    	List<char[]> list = new ArrayList<char[]>();
        list.add(new char[]{' '});
        list.add(new char[]{});
        list.add(new char[]{'a','b','c'});
        list.add(new char[]{'d','e','f'});
        list.add(new char[]{'g','h','i'});
        list.add(new char[]{'j','k','l'});
        list.add(new char[]{'m','n','o'});
        list.add(new char[]{'p','q','r','s'});
        list.add(new char[]{'t','u','v'});
        list.add(new char[]{'w','x','y','z'});
        List<String> ret = new ArrayList<String>();
        ret.add("");
        return build(ret, list, digits, 0);
    }

	private List<String> build(List<String> ret, List<char[]> list,
			String digits, int i) {
		if (0 == digits.length()) {
			return new ArrayList<String>();
		}
		if (i == digits.length()) {
			return ret;
		}
		int pos = digits.charAt(i)-'0';
		char[] str = list.get(pos);
		if (str.length == 0) {
			return ret;
		}
		List<String> newRet = new ArrayList<String>();
		for (String s : ret) {
			for (char ch : str) {
				newRet.add(s+ch);
			}
		}
		return build(newRet, list, digits, i+1);
	}
}