LeetCode-Problems/Easy Problems/1748_Sum_of_Unique_Elements.cpp at main · UdaySharmaGitHub/LeetCode-Problems · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
/*
1748. Sum of Unique Elements
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
*/
/*
        Using Hashing
    Time Complexity O(n)
    Space Complexity O(n)
*/
class Solution {
public:
    int sumOfUnique(vector<int>& nums) {
        if(nums.size()==1) return nums[0];
        map<int,int> f;
        for(int x:nums){
            f[x]++;
        }
        int sum = 0 ;
        for(auto i:f){
            if(i.second==1){sum+=i.first;}
        }
        return sum;
    }
};