package edu.wit.cs.comp1050;
import java.util.*;
public class LA1a {

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);

		System.out.print("Enter phrase 1: ");
		String word1 = input.nextLine();
		System.out.print("Enter phrase 2: ");
		String word2 = input.nextLine();

		int[] counter1 = countLetters(word1);
		int[] counter2 = countLetters(word2);


		boolean egg = sameCounts(counter1, counter2);

		if(egg==true) {System.out.println("These phrases are anagrams.");}
		else {System.out.println("These phrases are not anagrams.");}

	}

	public static int[] countLetters (String word) {

		char letter;
		int[] count = new int[] {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};



		for(int i=0; i < word.length(); i++) {
			letter = word.charAt(i);

			if(letter=='a' || letter=='A') {count[0]++;}
			if(letter=='b' || letter=='B') {count[1]++;}
			if(letter=='c' || letter=='C') {count[2]++;}
			if(letter=='d' || letter=='D') {count[3]++;}
			if(letter=='e' || letter=='E') {count[4]++;}
			if(letter=='f' || letter=='F') {count[5]++;}
			if(letter=='g' || letter=='G') {count[6]++;}
			if(letter=='h' || letter=='H') {count[7]++;}
			if(letter=='i' || letter=='I') {count[8]++;}
			if(letter=='j' || letter=='J') {count[9]++;}
			if(letter=='k' || letter=='K') {count[10]++;}
			if(letter=='l' || letter=='L') {count[11]++;}
			if(letter=='m' || letter=='M') {count[12]++;}
			if(letter=='n' || letter=='N') {count[13]++;}
			if(letter=='o' || letter=='O') {count[14]++;}
			if(letter=='p' || letter=='P') {count[15]++;}
			if(letter=='q' || letter=='Q') {count[16]++;}
			if(letter=='r' || letter=='R') {count[17]++;}
			if(letter=='s' || letter=='S') {count[18]++;}
			if(letter=='t' || letter=='T') {count[19]++;}
			if(letter=='u' || letter=='U') {count[20]++;}
			if(letter=='v' || letter=='V') {count[21]++;}
			if(letter=='w' || letter=='W') {count[22]++;}
			if(letter=='x' || letter=='X') {count[23]++;}
			if(letter=='y' || letter=='Y') {count[24]++;}
			if(letter=='z' || letter=='Z') {count[25]++;}
			}



		return count;

	}
	public static boolean sameCounts(int[] array1, int[] array2) {
	 boolean egg= true;
	 int j=0;

	 for(int i=0; i!=26; i++) {

		if(array1.length==array2.length){
													//	if(Arrays.equals(array1, array2)) {
		 	if(array1[j]!=array2[j])
			{egg=false;}
			j++;
		}
		}
		return egg;
	}

}