17-letter-combinations-of-a-phone-number

最新推荐文章于 2020-01-31 16:23:39 发布

原创最新推荐文章于 2020-01-31 16:23:39 发布 · 829 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#letter-combinations-of-a-phone #leetcode #java #算法

LeetCode 同时被 2 个专栏收录

36 篇文章

订阅专栏

leetcode

35 篇文章

订阅专栏

本文介绍了一个算法问题，即给定一个包含2到9的数字字符串，返回所有可能的字母组合，这些组合由电话键盘上对应的字母构成。文章提供了一种解决方案，通过递归方式生成所有可能的组合。

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

题目描述：

Given a string containing digits from 2-9 inclusive, 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. Note that 1 does not map to any letters.

Example:

Input: "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.

代码解答：

package com.jack.algorithm;

import com.alibaba.fastjson.JSONObject;

import java.util.*;

/**
 * create by jack 2018/10/30
 *
 * @author jack
 * @date: 2018/10/30 21:35
 * @Description:
 * 字符串组合
 */
public class LetterCombinationsOfAPhoneNumber {

    /**
     * 题目描述：
     * https://leetcode.com/problems/letter-combinations-of-a-phone-number/
     * @param digits
     * @return
     */
    public static List<String> letterCombinations(String digits) {
        List<String> rs = new ArrayList<>();
        if (digits == null || "".equals(digits)) {
            return rs;
        }
        Map<Character, char[]> map = getMap();
        rs = groupStr( rs,digits,map,0);
        return rs;
    }

    public static List<String> groupStr(List<String> rs,String digits,Map<Character, char[]> map,int index) {
        List<String> strList = new ArrayList<>();
        if (rs.isEmpty()) {
            char[] chars = map.get(digits.charAt(index));
            for (int i = 0; i < chars.length; i++) {
                strList.add(String.valueOf(chars[i]));
            }
        } else if (rs.get(0).length() != digits.length()) {
            for (String s : rs) {
                char[] chars = map.get(digits.charAt(index));
                for (int i = 0; i < chars.length; i++) {
                    strList.add(s + chars[i]);
                }
            }
        }
        rs = strList;
        if (rs.get(0).length() == digits.length()) {
            return rs;
        } else {
            return groupStr( rs,digits,map,++index);
        }

    }

    public static Map<Character, char[]> getMap() {
        Map<Character, char[]> map = new HashMap<>(16);
        map.put('2', new char[]{'a','b','c'});
        map.put('3', new char[]{'d','e','f'});
        map.put('4', new char[]{'g','h','i'});
        map.put('5', new char[]{'j','k','l'});
        map.put('6', new char[]{'m','n','o'});
        map.put('7', new char[]{'p','q','r','s'});
        map.put('8', new char[]{'t','u','v'});
        map.put('9', new char[]{'w','x','y','z'});
        return map;
    }

    public static void main(String[] args) {
        String str = "23";
        List<String> list = letterCombinations(str);
        System.out.println("list="+ JSONObject.toJSONString(list));
    }
}

源码地址：

源码