POJ 1002
来源:互联网 发布:开快捷酒店知乎 编辑:程序博客网 时间:2024/05/24 06:15
487-3279
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 254297 Accepted: 45281
Description
Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by dialing the memorable TUT-GLOP. Sometimes only part of the number is used to spell a word. When you get back to your hotel tonight you can order a pizza from Gino's by dialing 310-GINO. Another way to make a telephone number memorable is to group the digits in a memorable way. You could order your pizza from Pizza Hut by calling their ``three tens'' number 3-10-10-10.
The standard form of a telephone number is seven decimal digits with a hyphen between the third and fourth digits (e.g. 888-1200). The keypad of a phone supplies the mapping of letters to numbers, as follows:
A, B, and C map to 2
D, E, and F map to 3
G, H, and I map to 4
J, K, and L map to 5
M, N, and O map to 6
P, R, and S map to 7
T, U, and V map to 8
W, X, and Y map to 9
There is no mapping for Q or Z. Hyphens are not dialed, and can be added and removed as necessary. The standard form of TUT-GLOP is 888-4567, the standard form of 310-GINO is 310-4466, and the standard form of 3-10-10-10 is 310-1010.
Two telephone numbers are equivalent if they have the same standard form. (They dial the same number.)
Your company is compiling a directory of telephone numbers from local businesses. As part of the quality control process you want to check that no two (or more) businesses in the directory have the same telephone number.
The standard form of a telephone number is seven decimal digits with a hyphen between the third and fourth digits (e.g. 888-1200). The keypad of a phone supplies the mapping of letters to numbers, as follows:
A, B, and C map to 2
D, E, and F map to 3
G, H, and I map to 4
J, K, and L map to 5
M, N, and O map to 6
P, R, and S map to 7
T, U, and V map to 8
W, X, and Y map to 9
There is no mapping for Q or Z. Hyphens are not dialed, and can be added and removed as necessary. The standard form of TUT-GLOP is 888-4567, the standard form of 310-GINO is 310-4466, and the standard form of 3-10-10-10 is 310-1010.
Two telephone numbers are equivalent if they have the same standard form. (They dial the same number.)
Your company is compiling a directory of telephone numbers from local businesses. As part of the quality control process you want to check that no two (or more) businesses in the directory have the same telephone number.
Input
The input will consist of one case. The first line of the input specifies the number of telephone numbers in the directory (up to 100,000) as a positive integer alone on the line. The remaining lines list the telephone numbers in the directory, with each number alone on a line. Each telephone number consists of a string composed of decimal digits, uppercase letters (excluding Q and Z) and hyphens. Exactly seven of the characters in the string will be digits or letters.
Output
Generate a line of output for each telephone number that appears more than once in any form. The line should give the telephone number in standard form, followed by a space, followed by the number of times the telephone number appears in the directory. Arrange the output lines by telephone number in ascending lexicographical order. If there are no duplicates in the input print the line:
No duplicates.
No duplicates.
Sample Input
124873279ITS-EASY888-45673-10-10-10888-GLOPTUT-GLOP967-11-11310-GINOF101010888-1200-4-8-7-3-2-7-9-487-3279
Sample Output
310-1010 2487-3279 4888-4567 3
import java.util.Iterator;import java.util.Scanner;import java.util.Set;import java.util.TreeMap;/** * * @author bear * * TreeMap是有序的,HashMap是无序的 * */public class Poj1002 {public static void main(String[] args) {Scanner sc = new Scanner(System.in);//TreeMap是有序的,HashMap是无序的TreeMap<String, Integer> resultMap = new TreeMap<String, Integer>();int n = sc.nextInt();//将所有的'-'、'Q'、'Z'字符全部过滤掉for (int i = 0; i < n; i++) {String inputStr = sc.next();StringBuilder sb = new StringBuilder();for (int j = 0; j < inputStr.length(); j++) {char c = inputStr.charAt(j);boolean isValid = true;switch (c) {case 'A':case 'B':case 'C':c = '2';break;case 'D':case 'E':case 'F':c = '3';break;case 'G':case 'H':case 'I':c = '4';break;case 'J':case 'K':case 'L':c = '5';break;case 'M':case 'N':case 'O':c = '6';break;case 'P':case 'R':case 'S':c = '7';break;case 'T':case 'U':case 'V':c = '8';break;case 'W':case 'X':case 'Y':c = '9';break;case 'Q':case 'Z':case '-':isValid = false;break;default:break;}if (isValid) {sb.append(c);}}String temp = sb.toString();//如果已经有该字符串,数量就+1,否则设置数量为1if (resultMap.containsKey(temp)) {int oldVal = resultMap.get(temp);resultMap.put(temp, oldVal + 1);} else {resultMap.put(temp, 1);}}Set<String> resultSet = resultMap.keySet();Iterator<String> iterator = resultSet.iterator();boolean flag = false;while (iterator.hasNext()) {String temp = iterator.next();int times = resultMap.get(temp);if (times > 1) {flag = true;System.out.println(temp.substring(0, 3) + "-"+ temp.substring(3) + " " + resultMap.get(temp));}}if(!flag){System.out.println("No duplicates.");}}}
0 0
- POJ 1002
- POJ 1002
- POJ 1002
- POJ 1002
- poj 1002
- POJ 1002
- POJ 1002
- poj 1002
- poj 1002
- POJ 1002
- POJ-1002
- poj 1002
- poj 1002
- poj 1002
- poj 1002
- poj-1002
- POJ 1002
- POJ 1002
- 十分钟搞清字符集和字符编码
- 关于lua里面通过单张图片加载动画针的问题
- Ubuntu下安装mysql
- PDF转换成word的绿色软件推荐
- 数据库的连接JDBC
- POJ 1002
- C++指针详解
- IIS发布程序设置默认文档后CSS无效
- ios_dev
- 日经社説 20150413 地方政治の活力が低下していないか
- 蓝桥杯:基础练习 字母图形【JAVA算法实现】
- gsoap weather
- fiddler抓包参数乱码的解决方法
- IMSDroid的初步学习