算法训练 Anagrams问题

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

class Anagrams{
    private String Word;
    private HashMap<String, Integer> anagrams;

    public Anagrams(String word) {
        super();
        Word = word.toUpperCase();
        anagrams = new HashMap<String, Integer>();
    }

    public String Anagrams_str(){
        char[] word = new char[this.Word.length()];
        int cnt = 0;
        for ( int i = 0 ; i < this.Word.length() ; i++){
            String str = this.Word.substring(i, i+1);
            if (anagrams.containsKey(str)){
                this.anagrams.replace(str, this.anagrams.get(str) ,this.anagrams.get(str)+1);
            }else{
                this.anagrams.put(str, 1);
                word[cnt++] = this.Word.charAt(i);
            }
        }
        Arrays.sort(word);
        return new String(word);
    }

    public boolean Compare(Anagrams Other){
        boolean flag = true;
        String str1 = this.Anagrams_str();
        String str2 = Other.Anagrams_str();
        if (str1.equals(str2)){
            for ( int i = 0 ; i < str1.length() ; i++){
                if (this.anagrams.get(str1.charAt(i)) != Other.anagrams.get(str2.charAt(i))){
                    flag = false;
                    break;
                }
            }
        }else{
            flag = false;
        }
        return flag;
    }
}

public class Main {

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner in = new Scanner(System.in);
        String str1 = in.next();
        String str2 = in.next();
        Anagrams anagrams1 = new Anagrams(str1);
        Anagrams anagrams2 = new Anagrams(str2);
        if ( anagrams1.Compare(anagrams2)){
            System.out.print("Y");
        }else{
            System.out.print("N");
        }
        in.close();
    }
}