classSolution {
public:int sumOfUnique(vector<int>& nums) {
int cnt[101] = {};
for (int x : nums) cnt[x]++;
int ans =0;
for (int i =1; i <=100; ++i) if (cnt[i] ==1) ans += i;
return ans;
}
};
1
2
3
4
5
6
7
8
9
classSolution {
publicintsumOfUnique(int[] nums) {
int[] cnt =newint[101];
for (int x : nums) cnt[x]++;
int ans = 0;
for (int i = 1; i <= 100; ++i) if (cnt[i]== 1) ans += i;
return ans;
}
}
1
2
3
4
5
6
7
8
9
classSolution {
funsumOfUnique(nums: IntArray): Int {
val cnt = IntArray(101)
for (x in nums) cnt[x]++var ans = 0for (i in1..100) if (cnt[i] ==1) ans += i
return ans
}
}
1
2
3
4
classSolution:
defsumOfUnique(self, nums: list[int]) -> int:
from collections import Counter
return sum(x for x, c in Counter(nums).items() if c ==1)
1
2
3
4
5
6
7
8
use std::collections::HashMap;
impl Solution {
pubfnsum_of_unique(nums: Vec<i32>) -> i32 {
letmut cnt = std::collections::HashMap::new();
for x in nums.iter() { *cnt.entry(x).or_insert(0) +=1; }
cnt.into_iter().filter(|(_,c)|*c ==1).map(|(x,_)|*x).sum()
}
}
1
2
3
4
5
6
7
functionsumOfUnique(nums: number[]):number {
constcnt=newMap<number, number>();
for (constxofnums) cnt.set(x, (cnt.get(x) ??0) +1);
letans=0;
for (const [x, c] ofcnt.entries()) if (c===1) ans+=x;
returnans;
}