class Solution {
public int sumOfUnique(int[] nums) {
Map<Integer, Integer> cnt = new HashMap<Integer, Integer>();
for (int num : nums) {
cnt.put(num, cnt.getOrDefault(num, 0) + 1);
}
int ans = 0;
for (Map.Entry<Integer, Integer> entry : cnt.entrySet()) {
int num = entry.getKey(), c = entry.getValue();
if (c == 1) {
ans += num;
}
}
return ans;
}
}
22.2.6-唯一元素的和,哈希表
最新推荐文章于 2022-09-19 18:43:42 发布