【Java】letter combinations of phone number

/**
 * Created on 16/6/10.
 */
import java.util.InputMismatchException;
import java.util.Scanner;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
public class letterCombinationsOfPhoneNumber {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        String x = in.next();
        System.out.println(letterCombinationsOfPhoneNumber(x));
        System.out.println(letterCombinations(x));
    }

    public static ArrayList<String> letterCombinations(String digits) {
        HashMap<Character, String> map = new HashMap<Character, String>(){{
            put('2', "abc"); put('3', "def"); put('4', "ghi"); put('5', "jkl");
            put('6', "mno"); put('7', "pqrs"); put('8', "tuv"); put('9', "wxyz");
        }};

        ArrayList<String> ret = new ArrayList<>();
        if (digits.equals("")) {
            return ret;
        }
        dfs(digits, 0, "", map, ret);
        return ret;
    }

    public static void dfs(String digits, int index, String path, HashMap<Character, String> map, List<String> ret) {
        if (digits.length() == path.length()) {
            ret.add(path);
            return;
        }
        for (int i = index; i < digits.length(); i++) {
            for (char c : map.get(digits.charAt(i)).toCharArray()) {
                dfs(digits, i + 1, path + c, map, ret);
            }
        }
    }


    public static ArrayList<String> letterCombinationsOfPhoneNumber(String digits) {
        HashMap<Integer, String> map = new HashMap<Integer, String>();
        map.put(2, "abc");
        map.put(3, "def");
        map.put(4, "ghi");
        map.put(5, "jkl");
        map.put(6, "mno");
        map.put(7, "pqrs");
        map.put(8, "tuv");
        map.put(9, "wxyz");
        map.put(0, "");
        ArrayList<String> result = new ArrayList<>();
        if (digits == null || digits.length() == 0) {
            return result;
        }
        ArrayList<Character> tmp = new ArrayList<>();
        getString(digits, tmp, result, map);
        return result;
    }

    public static void getString(String digits, ArrayList<Character> tmp, ArrayList<String> result, HashMap<Integer, String> map) {
        if (digits.length() == 0) {
            char[] arr = new char[tmp.size()];
            for (int i = 0; i < tmp.size(); i++) {
                arr[i] = tmp.get(i);
            }
            result.add(String.valueOf(arr));
            return;
        }
        Integer curr = Integer.valueOf(digits.substring(0, 1));
        String letters = map.get(curr);
        for (int i = 0; i < letters.length(); i++) {
            tmp.add(letters.charAt(i));
            getString(digits.substring(1), tmp, result, map);
            tmp.remove(tmp.size() - 1);
        }
    }

}

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

余额充值