1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
| class Solution {
public int[] numberOfPairs(int[] nums) {
int[] res = new int[2];
Set<Integer> set = new HashSet<>();
for (int num : nums) {
if (set.contains(num)) {
set.remove(num);
} else {
set.add(num);
}
}
res[1] = set.size();
res[0] = (nums.length - set.size()) / 2;
return res;
}
}
|
References
2341. Maximum Number of Pairs in Array