Blogs Hub

Sum of Unique Elements - Array - Easy - LeetCode - MiniTV

Sum of Unique Elements - Array - Easy - LeetCode - मिनी टीवी

You are given an integer array nums. The unique elements of an array are the elements that appear exactly once in the array.

Return the sum of all the unique elements of nums.

 

Example 1:

Input: nums = [1,2,3,2]
Output: 4
Explanation: The unique elements are [1,3], and the sum is 4.
Example 2:

Input: nums = [1,1,1,1,1]
Output: 0
Explanation: There are no unique elements, and the sum is 0.
Example 3:

Input: nums = [1,2,3,4,5]
Output: 15
Explanation: The unique elements are [1,2,3,4,5], and the sum is 15.
 

Constraints:

1 <= nums.length <= 100
1 <= nums[i] <= 100

public class Solution {
    public int SumOfUnique(int[] nums) {
        var map = new Dictionary<int,int>();
        int sum = 0;
        for(int i=0;i<nums.Length;i++){
            if(map.TryGetValue(nums[i], out var count)){
                if(count==1){
                    sum -= nums[i];                    
                }
                map[nums[i]] = count + 1;
            }            
            else{
                sum += nums[i];
                map.Add(nums[i],1);
            }
        }
        
        return sum;
    }
}

Time Complexity: O(n)

Space Complexity: O(n)