PAT笔记
1035 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.
这题最开始的时候想复杂了,实际上就是只有当字符串中出现
1(one) ,0(zero),l(小写的l) ,O(大写的O)
的时候才需要进行替换。
那么我们可以设置一个标志位,当有这几个字母中任意一个时,进行替换,并且加入到结果集合中去,最后进行遍历。最后看清楚题目的输出格式。我们需要判断是1个账户还是多个账户。
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Main2 {
private static class Student{
String name;
String password;
public Student(String name,String password){
this.name=name;
this.password=password;
}
}
private static List<Student> students=new ArrayList<>();
public static void main(String[] args) {
Scanner input=new Scanner(System.in);
int n=input.nextInt();
input.nextLine();
List<Student> list=new ArrayList<>();
for(int i=0;i<n;i++){
String s=input.nextLine();
String split[]=s.split(" ");
boolean flag=false;
char ch[]=split[1].toCharArray();
for(int j=0;j<ch.length;j++){
if(ch[j]=='1'){
ch[j]='@';
flag=true;
}
else if(ch[j]=='0'){
ch[j]='%';
flag=true;
}
else if(ch[j]=='l'){
ch[j]='L';
flag=true;
}
else if(ch[j]=='O'){
ch[j]='o';
flag=true;
}
}
if(flag){
Student student=new Student(split[0],new String(ch));
list.add(student);
}
}
//表明没有重复的
if(list.size()==0){
if(n==1){
System.out.println("There is 1 account and no account is modified");
}else{
System.out.println("There are "+n+" accounts and no account is modified");
}
}else{
//表明有重复的
System.out.println(list.size());
for(Student student:list){
System.out.println(student.name+" "+student.password);
}
}
}
}