1748. Sum of Unique Elements Обновлено: 2024-03-12 1 мин Algorithms , LeetCode СодержаниеLeetCode problem 1748class Solution: def sumOfUnique(self, nums: List[int]) -> int: cnt = Counter(nums) return sum(x for x, v in cnt.items() if v == 1)