力扣136. 只出现一次的数字

使用位运算。对于这道题，可使用异或运算 \oplus⊕。异或运算有以下三个性质。

class Solution:
    def singleNumber(self, nums: List[int]) -> int:
        return reduce(lambda x,y:x^y,nums)

使用哈希表存储

class Solution:
    def singleNumber(self, nums: List[int]) -> int:
        dic_ = dict()
        for i in nums:
            if i not in dic_:
                dic_[i] = 1
            else:
                dic_[i] += 1
        for k,v in dic_.items():
            if v == 1:
                return k

其他数字出现三次，找到出现一次的数组
参考https://blog.csdn.net/qq_17550379/article/details/83926804?utm_medium=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-1.channel_param&depth_1-utm_source=distribute.pc_relevant.none-task-blog-BlogCommendFromMachineLearnPai2-1.channel_param

class Solution:
    def singleNumber(self, nums: List[int]) -> int:
        a = b =0
        for num in nums:
            a = ~b & (a^num)
            b = ~a & (b^num)
        return a