forked from anishLearnsToCode/leetcode-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
FindTheDifference.java
28 lines (25 loc) · 1.04 KB
/
FindTheDifference.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
import java.util.HashMap;
import java.util.Map;
public class FindTheDifference {
public char findTheDifference(String s, String t) {
Map<Character, Integer> frequenciesOrigin = getFrequencies(s);
Map<Character, Integer> frequenciesNew = getFrequencies(t);
return difference(frequenciesOrigin, frequenciesNew);
}
private Map<Character, Integer> getFrequencies(String string) {
Map<Character, Integer> frequencies = new HashMap<>();
for (int index = 0 ; index < string.length() ; index++) {
char character = string.charAt(index);
frequencies.put(character, frequencies.getOrDefault(character, 0) + 1);
}
return frequencies;
}
private char difference(Map<Character, Integer> frequencies2, Map<Character, Integer> frequencies1) {
for (Character character : frequencies1.keySet()) {
if (frequencies1.get(character) != frequencies2.getOrDefault(character, 0)) {
return character;
}
}
return '\0';
}
}