Medium 17题 Letter Combinations of a Phone Number

Question:

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.


Solution:

public class Solution {
    private static final String[] KEYS = { "", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" };
    public List<String> letterCombinations(String digits) {
        List<String> ret = new LinkedList<String>();
    	combination("", digits, 0, ret);
    	return ret;
    }
    public void combination(String prefix, String digits, int offset, List<String> ret){
        if(offset==digits.length())
        {
            ret.add(prefix);
            return;
        }
        String letter=KEYS[digits.charAt(offset)-'0'];
        for(int i=0;i<=letter.length()-1;i++)
        {
            combination(prefix+letter.charAt(i),digits,offset+1,ret);
        }
    }
}

需要加一个判断:

public class Solution {
    private static final String[] KEYS = { "", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" };
    public List<String> letterCombinations(String digits) {
        List<String> ans=new LinkedList<String>();
        if(digits.length()==0)
            return ans;
        combination("",digits,0,ans);
        return ans;
    }
    public void combination(String prefix, String digits, int offset, List<String> ans){
        if(digits.length()==offset)
        {
            ans.add(prefix);
            return;
        }
        String p=KEYS[digits.charAt(offset)-'0'];
        for(int i=0;i<=p.length()-1;i++)
        {
            combination(prefix+p.charAt(i),digits,offset+1,ans);
        }
    }
}

11/19

   comb(res,digits,tmp+letter.charAt(i),offset+1); //++offset,和offset+1差别

以及另一种解法

 LinkedList<String> res = new LinkedList<String>();
        if(digits.length()==0)
            return res;
        res.add("");
        String[] KEY = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
        for(int i =0; i<=digits.length()-1;i++){
            String letter = KEY[digits.charAt(i)-'0'];
            while(res.peek().length()==i){
                String tmp = res.remove();
                for(int j=0;j<=letter.length()-1;j++)
                    res.add(tmp+letter.charAt(j));
            }
        }
        return res;



  • 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、付费专栏及课程。

余额充值