[LeetCode Python3] 260. Single Number III +集合

260. Single Number III

集合的删除、添加、查找的时间复杂度均为O(1)

Time:O(n); Space: O(3)

class Solution:
    def singleNumber(self, nums: List[int]) -> List[int]:
        res = set()
        for num in nums:
            if num in res:
                res.remove(num)
            else:
                res.add(num)
        return list(res)