PAT乙级：1029 旧键盘（JAVA）

import java.util.*;
public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner reader = new  Scanner(System.in);
		String input = reader.nextLine();
		String wrong = reader.nextLine();
		String[] wrongArr = new String[wrong.length()] ;
		String[] inputArr = new String[input.length()];
 		for(int i=0;i<wrongArr.length;i++) {
			wrongArr[i] = "-1";
			inputArr[i] = "-1";
		}
		wrongArr[0] = wrong.substring(0,1);
		int count=1;
		for(int i=0;i<wrong.length();i++) {
			boolean flag = true;
			String temp = wrong.substring(i,i+1);
			for(int j=0;j<wrongArr.length;j++) {
				if(wrongArr[j].equals(temp)) {
					flag = false;
					break;
				}
			}
			if(flag) {
				wrongArr[count++] = temp;
			}
		}
		count =0;
		for(int i=0;i<input.length();i++) {
			String temp = input.substring(i,i+1);
			boolean flag = judge(temp,wrongArr);
			boolean flag2 = true;
			if(flag) {
				temp = temp.toUpperCase();
				for(int j=0;j<inputArr.length;j++) {
					if(temp.equals(inputArr[j])) {
						flag2=false;
						break;
					}
				}
				if(flag2) {
					inputArr[count++] = temp;
				}
				
			}
		}
		for(int i=0;i<inputArr.length;i++) {
			if(inputArr[i].equals("-1")) {
				break;
			}
			System.out.print(inputArr[i]);
		}
	}
	public static Boolean judge(String str, String[] wrongArr) {
		for(int i =0;i<wrongArr.length;i++) {
			if(str.equals(wrongArr[i])) {
				return false;
			}
		}
		return true;
	}
}

我的思路：首先拿到坏掉的键，通过循环判断，得到一个含有唯一的坏键值数组wrongArr,再通过循环输入的键，和坏键值数组进行比较，判断该输入值是否是坏键数组里面的值，如果不是，在输出数组中添加其大写值toUpperCase()