A1035-PAT甲级JAVA题解 Password

To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem is that there are always some confusing passwords since it is hard to distinguish 1 (one) from l (L in lowercase), or 0 (zero) from O (o in uppercase). One solution is to replace 1 (one) by @, 0 (zero) by %, l by L, and O by o. Now it is your job to write a program to check the accounts generated by the judge, and to help the juge modify the confusing passwords.

Input Specification:

Each input file contains one test case. Each case contains a positive integer N (≤1000), followed by N lines of accounts. Each account consists of a user name and a password, both are strings of no more than 10 characters with no space.

Output Specification:

For each test case, first print the number M of accounts that have been modified, then print in the following M lines the modified accounts info, that is, the user names and the corresponding modified passwords. The accounts must be printed in the same order as they are read in. If no account is modified, print in one line There are N accounts and no account is modified where N is the total number of accounts. However, if N is one, you must print There is 1 account and no account is modified instead.

Sample Input 1:

3
Team000002 Rlsp0dfa
Team000003 perfectpwd
Team000001 R1spOdfa

Sample Output 1:

2
Team000002 RLsp%dfa
Team000001 R@spodfa

Sample Input 2:

1
team110 abcdefg332

Sample Output 2:

There is 1 account and no account is modified

Sample Input 3:

2
team110 abcdefg222
team220 abcdefg333

Sample Output 3:

There are 2 accounts and no account is modified

核心思路:

        替换容易看错的字符,输出含有易错字符的更改结果

        如果都不含有易错字符,需要输出指定语句,区分单复数

注意:

        使用LinkedHashMap()保证输出顺序和输入顺序相同

import java.util.HashMap;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N=sc.nextInt();
		//1->@
		//0->%
		//l->L
		//O->o
		Map<String,String> maps=new LinkedHashMap<>();
		boolean flag=false;
		for(int i=0;i<N;i++) {
			String a=sc.next();
			String b=sc.next();
			String res="";
			for(int k=0;k<b.length();k++) {
				switch (b.charAt(k)) {
					case '1': {
						res+='@';
						break;
					}
					case '0':{
						res+='%';
						break;
					}
					case 'l':{
						res+='L';
						break;
					}
					case 'O':{
						res+='o';
						break;
					}
					default:
						res+=b.charAt(k);
				}
			}
			if(!res.equals(b)) {
				flag=true;
				maps.put(a, res);
			}
		}
		if(!maps.isEmpty()) {
			System.out.println(maps.size());
			for(Map.Entry<String, String> entry:maps.entrySet()) {
				System.out.println(entry.getKey()+" "+entry.getValue());
			}
		}else {
			System.out.println("There "+(N>1?"are "+N+" accounts ":"is "+N+" account ")+"and no account is modified");
		}
	}
}