Leetcode-1748 Sum of Unique Elements Solution in Java | Hindi Coding Community

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

You have to 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

Java Code :

class Solution {

public int sumOfUnique(int[] nums) {

HashMap<Integer,Integer> hs= new HashMap<Integer,Integer>();

int sum=0;

for(int i=0;i<nums.length;i++)

{

if(hs.containsKey(nums[i]))

{

hs.put(nums[i],hs.get(nums[i])+1);

}

else{

hs.put(nums[i],1);

}

}

for(Map.Entry<Integer,Integer> e: hs.entrySet()){

if(e.getValue()==1){

sum+=e.getKey();

}

}

return sum;

}

}