蓝桥杯 ALGO-91 Anagrams问题

代码：

很简单 看一眼就懂了

import java.util.Scanner;

public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		String s1 = sc.next().toLowerCase();
		String s2 = sc.next().toLowerCase();
		int[] n1 = new int[27];
		int[] n2 = new int[27];
		for (int i = 0; i < s1.length(); i++) {
			n1[s1.charAt(i)-'a']++;
		}
		for (int i = 0; i < s2.length(); i++) {
			n2[s2.charAt(i)-'a']++;
		}
		for (int i = 0; i < n1.length; i++) {
			if(n1[i]!=n2[i]){
				System.out.println("N");
				return;
			}
		}
		System.out.println("Y");
		
		
	}
}