只出现一次的数字II-位运算137-python

python

class Solution:
    def singleNumber(self, nums: List[int]):
        res = 0

        for i in range(32):
            count = 0
            for num in nums:
                count += (num >> i) & 1
            
            if count % 3 != 0:
                res += pow(2, i)
        
        return res if (res>>31) & 1 == 0 else -((res^0xffffffff)+1)