Letter Combinations of a Phone Number

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.

本题速度差别主要体现在建立字典地方法,下边是两种方法:第一种beats 50%,第二种beats 8%。

public class Solution {
    public List<String> letterCombinations(String digits) {
        List<String> result = new ArrayList<String>();
        String[] map = new String[] { "", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" };
        char[] tmp = new char[digits.length()];
        if(digits.length() == 0)
            return result;
        rec(digits, 0, tmp, map, result);
        return result;
    }
    public void rec(String digits, int index, char[] tmp, String[] map, List<String> result){
        if(index == digits.length()){
            result.add(new String(tmp));
            return;
        }
        char tmpChar = digits.charAt(index);
        for(int i = 0; i < map[tmpChar - '0'].length(); i++){
            tmp[index] = map[tmpChar - '0'].charAt(i);
            rec(digits, index + 1, tmp, map, result);
        }
    }
}

public class Solution {
    public List<String> letterCombinations(String digits) {
    	ArrayList<String> result=new ArrayList<>();
		if(digits.length()==0)return result;
		HashMap<Integer, List<Character>> hashMap=new HashMap<>();
		for(int i=2;i<10;i++){
			ArrayList<Character> tem=new ArrayList<>();
			if(i==7){
				tem.add('p');
				tem.add('q');
				tem.add('r');
				tem.add('s');
			}else if (i==8) {
				tem.add('t');
				tem.add('u');
				tem.add('v');
			}else if (i==9) {
				tem.add('w');
				tem.add('x');
				tem.add('y');
				tem.add('z');
			}else {
				for(int j=0;j<3;j++){
					tem.add((char)((i-2)*3+'a'+j));
				}
			}
			hashMap.put(i, tem);
		}
		doFor(hashMap, result, new StringBuilder(), digits, 0);
        return result;
    }
    void doFor(Map<Integer, List<Character>> map,List<String> list,StringBuilder builder,String string,int i){
		
		for(char c:map.get(string.charAt(i)-'0')){
			builder.append(c);
			if(i==string.length()-1){
				list.add(builder.toString());
			}else {
				doFor(map, list, builder, string, i+1);
			}
			builder.setLength(builder.length()-1);
		}
    }
}


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

余额充值