forked from anishLearnsToCode/leetcode-algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
SumOfUniqueElements.java
37 lines (33 loc) · 1.11 KB
/
SumOfUniqueElements.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
29
30
31
32
33
34
35
36
37
import java.util.Collection;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
public class SumOfUniqueElements {
public int sumOfUnique(int[] nums) {
final Set<Integer> uniqueElements = uniqueElements(nums);
return sum(uniqueElements);
}
private Set<Integer> uniqueElements(int[] array) {
final Map<Integer, Integer> frequencies = getFrequencies(array);
final Set<Integer> set = new HashSet<>();
for (Map.Entry<Integer, Integer> entry : frequencies.entrySet()) {
if (entry.getValue() == 1) set.add(entry.getKey());
}
return set;
}
private Map<Integer, Integer> getFrequencies(int[] array) {
final Map<Integer, Integer> frequencies = new HashMap<>();
for (int element : array) {
frequencies.put(element, frequencies.getOrDefault(element, 0) + 1);
}
return frequencies;
}
private int sum(Collection<Integer> collection) {
int sum = 0;
for (int element : collection) {
sum += element;
}
return sum;
}
}