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.


解法一:

对数字进行解析,相当于遍历一棵树,可以使用数的遍历算法

public List<String> letterCombinations(String digits) {
		List<String> result = new ArrayList<String>();
		String[] map = new String[10];
		map[0] = "";
		map[1] = "";
		map[2] = "abc";
		map[3] = "def";
		map[4] = "ghi";
		map[5] = "jkl";
		map[6] = "mno";
		map[7] = "pqrs";
		map[8] = "tuv";
		map[9] = "wxyz";
		char[]	middleTemp = new char[digits.length()];
		dfsGetStr(digits, 0, middleTemp, map, result); 
		return result;
    }
	
	private void dfsGetStr(String digits,int index, 
			char[] middleStr, String[] map, List<String> result) {
		if(index == digits.length()) {
			result.add(new String(middleStr));
			return ;
		}
		char strChar = digits.charAt(index);
		for(int i=0; i<map[strChar-'0'].length(); i++) {
			middleStr[index] = map[strChar-'0'].charAt(i);
			dfsGetStr(digits, index+1, middleStr, map, result);
		}
	}

解法二:

直接使用循环求解

public List<String> letterCombinations(String digits) {
		List<String> result = new ArrayList<String>();
		if(digits.isEmpty()) {
			result.add("");
			return result;
		}
		
		String[] map = new String[10];
		map[0] = "";
		map[1] = "";
		map[2] = "abc";
		map[3] = "def";
		map[4] = "ghi";
		map[5] = "jkl";
		map[6] = "mno";
		map[7] = "pqrs";
		map[8] = "tuv";
		map[9] = "wxyz";
		
		int[] number = new int[digits.length()];	//存储digits中每个字符在循环中的编号,初始为0
		
		int k = digits.length()-1;
		while(k>=0) {
			k = digits.length()-1;
			char[] charTemp = new char[digits.length()];
			for(int i=0; i<digits.length(); i++) {
				charTemp[i] = map[digits.charAt(i)-'0'].charAt(number[i]);
			}
			result.add(new String(charTemp));
			while(k>=0) {
				if( number[k] < (map[digits.charAt(k)-'0'].length()-1) ) {
					number[k]++;
					break;
				} else {
					number[k] = 0;
					k--;
				}
			}
		}
		
		return result;
    }









(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
评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值