Skip to content

Commit 986cb7a

Browse files
fix
1 parent 4ae2e8d commit 986cb7a

File tree

1 file changed

+25
-25
lines changed

1 file changed

+25
-25
lines changed

Solved-Problems/Valid_Anagram/Main.java

Lines changed: 25 additions & 25 deletions
Original file line numberDiff line numberDiff line change
@@ -2,30 +2,30 @@
22
import java.util.Map;
33

44
class 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

Comments
 (0)