#1748

Sum of Unique Elements

newbie · 170 · lc easy +15 · premium · verified · 79.8% accepted · 1,691 likes · top 91%

Description

Given an integer array nums, return the sum of all elements that appear exactly once.

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.

Code

1

2

3

class Solution:
    def sumOfUnique(self, nums: List[int]) -> int:

class Solution:
    def sumOfUnique(self, nums: List[int]) -> int: