ancientcipher.java

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

package PKU;
import java.util.*;


/**
 * ID:2159
 * 排序
 * @author yhm
 *
 */
public class AncientCipher {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		while(cin.hasNext()){
			String a = cin.next();
			String b = cin.next();
			solve(a,b);
		}

	}
	
	static void solve(String a, String b){
		int[] a1 = new int[26];
		int[] a2 = new int[26];
		int len1 = a.length();
		int len2 = b.length();
		for(int i=0;i<len1;i++){
			int index = a.charAt(i)-'A';
			a1[index]++;
		}
		for(int i=0;i<len2;i++){
			int index = b.charAt(i)-'A';
			a2[index]++;
		}
		
		Arrays.sort(a1);
		Arrays.sort(a2);
		
		for(int i=0;i<26;i++){
			if(a1[i]!=a2[i]){
				System.out.println("NO");
				return;
			}
		}
		System.out.println("YES");
		
	}

}