洛谷潜伏者JAVA实现

勉强过的代码
希望路过的大神或同志
提提建议

import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		char x[] = new char[91];//A-Z为65到90
		while (sc.hasNext()) {
			String a = sc.next();
			String b = sc.next();
			int e = 0;
			char A[] = a.toCharArray();
			char B[] = b.toCharArray();
			if (a.length() == 1) {  
				e = 1;
			}
			for (int i = 0; i < x.length; i++) { //初始化赋值
				x[i] = '1';
			}
			for (int i = 0; i < A.length; i++) {
				int C = (int) A[i];
				if (x[C] != '1' && x[C] != B[i]) {  //是否出现第2情况
					e = 1;
					break;
				}
				x[C] = B[i];
			}
			String c = sc.next();
			char d[] = c.toCharArray();
			for (int i = 0; i < d.length; i++) {
				int h = (int) d[i];
				if (x[h] == '1') {
					e = 1;
					break;
				}
				d[i] = x[h];
			}
			Arrays.sort(x);
			for (int i = 0; i < x.length - 1; i++) {  //是否出现第3情况
				if (x[i] != '1' && x[i] == x[i + 1]) {
					e = 1;
					break;
				}
			}
			if (e == 1) {
				System.out.println("Failed");
			} else {
				for (int i = 0; i < d.length; i++) {
					if (i == d.length - 1) {
						System.out.println(d[i]);
					} else {
						System.out.print(d[i]);
					}
				}
			}
		}
	}

}