algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-09 12:11:28 +08:00
Code Issues Packages Projects Releases Wiki Activity

Formatted with Google Java Formatter

Browse Source
This commit is contained in:
github-actions
2021-02-21 01:02:32 +00:00
parent a475463146
commit ee64ac8084
1 changed files with 38 additions and 38 deletions
Download Patch File Download Diff File Expand all files Collapse all files

76
strings/CheckAnagrams.java
View File

@ -8,45 +8,45 @@ import java.util.Map;
* case). * case).
*/ */
public class CheckAnagrams { public class CheckAnagrams {
public static void main(String[] args) { public static void main(String[] args) {
assert isAnagrams("Silent", "Listen"); assert isAnagrams("Silent", "Listen");
assert isAnagrams("This is a string", "Is this a string"); assert isAnagrams("This is a string", "Is this a string");
assert !isAnagrams("There", "Their"); assert !isAnagrams("There", "Their");
}
/**
* Check if two strings are anagrams or not
*
* @param s1 the first string
* @param s2 the second string
* @return {@code true} if two string are anagrams, otherwise {@code false}
*/
public static boolean isAnagrams(String s1, String s2) {
int l1 = s1.length();
int l2 = s2.length();
s1 = s1.toLowerCase();
s2 = s2.toLowerCase();
Map<Character, Integer> charAppearances = new HashMap<>();
for (int i = 0; i < l1; i++) {
char c = s1.charAt(i);
int numOfAppearances = charAppearances.getOrDefault(c, 0);
charAppearances.put(c, numOfAppearances + 1);
} }
/** for (int i = 0; i < l2; i++) {
* Check if two strings are anagrams or not char c = s2.charAt(i);
* if (!charAppearances.containsKey(c)) {
* @param s1 the first string return false;
* @param s2 the second string }
* @return {@code true} if two string are anagrams, otherwise {@code false} charAppearances.put(c, charAppearances.get(c) - 1);
*/
public static boolean isAnagrams(String s1, String s2) {
int l1 = s1.length();
int l2 = s2.length();
s1 = s1.toLowerCase();
s2 = s2.toLowerCase();
Map<Character, Integer> charAppearances = new HashMap<>();
for (int i = 0; i < l1; i++) {
char c = s1.charAt(i);
int numOfAppearances = charAppearances.getOrDefault(c, 0);
charAppearances.put(c, numOfAppearances + 1);
}
for (int i = 0; i < l2; i++) {
char c = s2.charAt(i);
if (!charAppearances.containsKey(c)) {
return false;
}
charAppearances.put(c, charAppearances.get(c) - 1);
}
for (int cnt : charAppearances.values()) {
if (cnt != 0) {
return false;
}
}
return true;
} }
for (int cnt : charAppearances.values()) {
if (cnt != 0) {
return false;
}
}
return true;
}
} }