17. Letter Combinations of a Phone Number

一、题目

  1、审题

    

 

  2、分析:

      给出数字组成的字符串,求他所对应电话号码中的字母所组成的字符串的集合。

 

二、解答

  1、分析:

    a、依次截取字符串中的数字,作为switch 语句的条件调用 case;

    b、case 中将原 List 中所有字符串与数字对应的字母集合 List 进行全连接;

    c、注意: ArrayList 中的元素依照放入顺序存放;故,连接后去除原 List 中的起始元素即为实现了全连接

class Solution {
    public List<String> letterCombinations(String digits) {
        int len = digits.length();
        List<String> targetList = new ArrayList<String>();
        if(len == 0)
            return targetList;

        int i = 0;
       
        while(i < len) {
            switch (digits.charAt(i++) - '0') {
                case 2:
                    conbindString(targetList, Arrays.asList("a", "b", "c"));
                    break;
                case 3:
                    conbindString(targetList, new ArrayList<String>(Arrays.asList("d", "e", "f")));
                    break;
                case 4:
                    conbindString(targetList, new ArrayList<String>(Arrays.asList("g", "h", "i")));
                    break;
                case 5:
                    conbindString(targetList, new ArrayList<String>(Arrays.asList("j", "k", "l")));
                    break;
                case 6:
                    conbindString(targetList, new ArrayList<String>(Arrays.asList("m", "n", "o")));
                    break;
                case 7:
                    conbindString(targetList, new ArrayList<String>(Arrays.asList("p", "q", "r", "s")));
                    break;
                case 8:
                    conbindString(targetList, new ArrayList<String>(Arrays.asList("t", "u", "v")));
                    break;
                case 9:
                    conbindString(targetList, new ArrayList<String>(Arrays.asList("w", "x", "y", "z")));
                    break;
                default:
                    break;
            }
        }

        return targetList;
    }

    public void conbindString(List<String> aList, List<String> bList) {

        int len = aList.size();
        if(len == 0) {
            aList.addAll(bList);
            return;
        }

        for (int i = 0; i < len; i++) {

            String s = aList.get(0);
            for (int j = 0; j < bList.size(); j++)
                aList.add(s + bList.get(j));

            aList.remove(0);
        }
    }
}

 

转载于:https://www.cnblogs.com/skillking/p/9410285.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
(Telephone Number Word Generator) Standard telephone keypads contain the digits 0 through 9. The numbers 2 through 9 each have three letters associated with them, as is indicated by the following table: Many people find it difficult to memorize phone numbers, so they use the correspondence between digits and letters to develop seven-letter words that correspond to their phone numbers. For example, a person whose telephone number is 686-2377 might use the correspondence indi- cated in the above table to develop the seven-letter word “NUMBERS.” Businesses frequently attempt to get telephone numbers that are easy for their clients to remember. If a business can advertise a simple word for its customers to dial, then no doubt the business will receive a few more calls. Each seven-letter word corresponds to exactly one seven-digit telephone number. The restaurant wishing to increase its take-home business could surely do so with the number 825-3688 (i.e., “TAKEOUT”). Each seven-digit phone number corresponds to many separate seven-letter words. Unfortunately, most of these represent unrecognizable juxtaposi- tions of letters. It’s possible, however, that the owner of a barber shop would be pleased to know that the shop’s telephone number, 424-7288, corresponds to “HAIRCUT.” A veterinarian with the phone number 738-2273 would be happy to know that the number corresponds to “PETCARE.” Write a program that, given a seven-digit number, writes to a file every possible seven-letter word corresponding to that number. There are 2187 (3 to the seventh power) such words. Avoid phone numbers with the digits 0 and 1.
最新发布
06-09

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值