22import java .util .Map ;
33
44class Main {
5- public boolean isAnagram (String s , String t ) {
6- if (s .length () != t .length ()) {
7- return false ;
8- }
9-
10- Map <Character , Integer > countS = new HashMap <>();
11- Map <Character , Integer > countT = new HashMap <>();
5+ public boolean isAnagram (String s , String t ) {
6+ if (s .length () != t .length ()) {
7+ return false ;
8+ }
9+
10+ Map <Character , Integer > countS = new HashMap <>();
11+ Map <Character , Integer > countT = new HashMap <>();
12+
13+ for (int i = 0 ; i < s .length (); i ++) {
14+ char c1 = s .charAt (i );
15+ countS .put (c1 , countS .getOrDefault (c1 , 0 ) + 1 );
16+ }
1217
13- for (int i = 0 ; i < s .length (); i ++) {
14- char c1 = s .charAt (i );
15- countS .put (c1 , countS .getOrDefault (c1 , 0 ) + 1 );
16- }
17-
18- for (int i = 0 ; i < t .length (); i ++) {
19- char c2 = t .charAt (i );
20- countT .put (c2 , countT .getOrDefault (c2 , 0 ) + 1 );
21- }
22-
23- for (char c : countS .keySet ()) {
24- if (!countT .containsKey (c ) || !countT .get (c ).equals (countS .get (c ))) {
25- return false ;
26- }
27- }
28-
29- return true ;
18+ for (int i = 0 ; i < t .length (); i ++) {
19+ char c2 = t .charAt (i );
20+ countT .put (c2 , countT .getOrDefault (c2 , 0 ) + 1 );
3021 }
31- }
22+
23+ for (char c : countS .keySet ()) {
24+ if (!countT .containsKey (c ) || !countT .get (c ).equals (countS .get (c ))) {
25+ return false ;
26+ }
27+ }
28+
29+ return true ;
30+ }
31+ }
0 commit comments