We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Java
  3. Strings
  4. Java Anagrams
  5. Discussions

Java Anagrams

  • impex_ua
     + 8 comments

    I also started from HashMap but than I realized that getting value for each containsKey=true case is a bit of complicated. I also did not like the extra loop which I had to use to validate the collected data. So I used int [] and processed the values through summ variable right inside the first loop:

    static boolean isAnagram(String a, String b) {

        if (a.length() != b.length()) return false;
        
        a = a.toLowerCase();
        b = b.toLowerCase();
        
        int [] temp = new int [Character.MAX_VALUE]; 
	//sry, too lazy to calculate ASCII idx of a-z rel. i :)
        
        int summ = 0;

        for (int i = 0; i < a.length(); i++){
            summ += ++temp [a.charAt(i)] <= 0 ? -1 : 1;
            summ += --temp [b.charAt(i)] >= 0 ? -1 : 1;
        }

        return summ == 0;
        
}