唯一元素的和

• 代码

代码

class Solution {
    public int sumOfUnique(int[] nums) {
        Map<Integer, Integer> map = new HashMap<>();
        int res = 0;
        for (int num : nums) {
            if (!map.containsKey(num)) {
                res += num;
                map.put(num, 1);
            } else if (map.get(num) == 1) {
                res -= num;
                map.put(num, 2);
            }
        }
        return  res;
    } 
}