1748.sum-of-unique-elements

Statement

简体中文English

Metadata

• Link: 唯一元素的和
• Difficulty: Easy
• Tag: 数组 哈希表 计数

给你一个整数数组 nums 。数组中唯一元素是那些只出现 恰好一次 的元素。

请你返回 nums 中唯一元素的 和 。

 

示例 1：

输入：nums = [1,2,3,2]
输出：4
解释：唯一元素为 [1,3] ，和为 4 。

示例 2：

输入：nums = [1,1,1,1,1]
输出：0
解释：没有唯一元素，和为 0 。

示例 3 ：

输入：nums = [1,2,3,4,5]
输出：15
解释：唯一元素为 [1,2,3,4,5] ，和为 15 。

 

提示：

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

Metadata

• Link: Sum of Unique Elements
• Difficulty: Easy
• Tag: Array Hash Table Counting

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

Solution

Python 3

from typing import Counter, List


class Solution:
    def sumOfUnique(self, nums: List[int]) -> int:
        m = Counter(nums)
        return sum(filter(lambda x: m[x] == 1, m.keys()))

---

最后更新: October 11, 2023