id4873279.java

来自「PKU中一些数据结构基本算法题的java实现」· Java 代码 · 共 84 行

import java.util.*;



/**
 * ID:1002
 * @author yhm
 *
 */
public class ID4873279 {

	static String[] map;
	static boolean[] use;
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		int num = cin.nextInt();
		map = new String[num];
		use = new boolean[num];
		Arrays.fill(use, false);
		for(int i=0;i<num;i++){
			String str = cin.next();
			String result = translate(str);
			map[i] = result;

		}
		boolean noResult = true;
		Arrays.sort(map);
		for(int i=0;i<num;i++){
			int sum = 0;
			if(use[i]) continue;
			for(int j=0;j<num;j++){
				if(map[i].equals(map[j])){
					sum++;
					use[i] = true;
					use[j] = true;
				}
			}
			if(sum>1){
				System.out.println(map[i]+" "+sum);
				noResult = false;
			}
		}

		

		if(noResult){
			System.out.println("No duplicates.");
		}

	}

	
	static String translate(String str){
		int len = str.length();
		StringBuffer r = new StringBuffer();
		for(int i=0;i<len;i++){
			char ch = str.charAt(i);
			if(ch=='-'){
				continue;
			}
			else if(ch>='A'&&ch<='Q'){
				int ch1 = (ch-'A')/3+2;
				r.append(ch1);				
			}
			else if(ch>'Q'){
				int ch1 = (ch-'A'-1)/3+2;
				r.append(ch1);	
			}
			else{
				r.append(ch);
			}
		}
		r.insert(3, '-');
		return r.toString();
	}
}

class Count{
	int i = 0;
}