1002-487-3279*北京大学acm-oj-java语言题解

  • 时间:
  • 浏览:
  • 来源:互联网
				题目:487-3279

Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 330355 Accepted: 58499
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.

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.
Sample Input

12
4873279
ITS-EASY
888-4567
3-10-10-10
888-GLOP
TUT-GLOP
967-11-11
310-GINO
F101010
888-1200
-4-8-7-3-2-7-9-
487-3279
Sample Output

310-1010 2
487-3279 4
888-4567 3

ac代码


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;
import java.util.TreeMap;

public class a4873279 {

	public static void main(String[] args) throws IOException {
		InputStreamReader r=new InputStreamReader(System.in);
        BufferedReader br = new BufferedReader(r);
        int n=Integer.valueOf(br.readLine());
        String s="";
        TreeMap map=new TreeMap<String,String>();	//TreeMap可以有序排序
        char[] ch=new char[7];
        String temp="";
        for(int i=0;i<n;i++)
        {
        	s = br.readLine();
        	s=s.replace("-", "");	//读取的字符去“-”
        	ch=s.toCharArray();
        	for(int j=0;j<7;j++)	//将字符串中的字母转成数字
        	{
        		if(ch[j]=='A'||ch[j]=='B'||ch[j]=='C')
        		{
        			ch[j]='2';
        		}else if(ch[j]=='D'||ch[j]=='E'||ch[j]=='F')
        		{
        			ch[j]='3';
        		}else if(ch[j]=='G'||ch[j]=='H'||ch[j]=='I')
        		{
        			ch[j]='4';
        		}else if(ch[j]=='J'||ch[j]=='K'||ch[j]=='L')
        		{
        			ch[j]='5';
        		}else if(ch[j]=='M'||ch[j]=='N'||ch[j]=='O')
        		{
        			ch[j]='6';
        		}else if(ch[j]=='P'||ch[j]=='R'||ch[j]=='S')
        		{
        			ch[j]='7';
        		}else if(ch[j]=='T'||ch[j]=='U'||ch[j]=='V')
        		{
        			ch[j]='8';
        		}else if(ch[j]=='W'||ch[j]=='X'||ch[j]=='Y')
        		{
        			ch[j]='9';
        		}
        	}
        	s="";		
        	for(int j=0;j<7;j++) //将char[]转成字符串,并在第三个数字后面加个“-”:
        	{
        		s=s+ch[j];
        		if(j==2)
        		{
        			s=s+"-";
        		}
        	}
        	
        	//判断map里面是否包含这个字符串的key
        	if(!map.containsKey(s))
        	{	
        		//如果不包含,就将该key放进map里面,会自动排序
        		map.put(s, "1");
        	}else		//如果包含有,就将这个key的value值取出并加一
        	{
        		temp=(String)map.get(s);
        		temp=String.valueOf(Integer.valueOf(temp)+1);
        		map.put(s, temp);
        	}
        }
        br.close();	//关闭输入流
        r.close();
        //获取map的key
        Set keySet=map.keySet();
        Iterator it=keySet.iterator();
        String key="";
        String value="";
        int te=0;
        int aa=0;
        while(it.hasNext())
        {
        	key=(String)it.next();
        	value=(String)map.get(key);
        	te=Integer.valueOf(value);
        	if(te>=2)
        	{
        		aa=1;
        		System.out.println(key+" "+value);
        	}
        }
        //如果aa等于零代表没有找到合适的值
        if(aa==0)
        {
        	System.out.println("No duplicates.");
        }
 
        
       
 

	}

}

本文链接http://www.dzjqx.cn/news/show-617521.html