Python Solution

  • 2
    def singleNumber(self, nums):
        ab = m = reduce(operator.xor, nums)  # a ^ b
        m &= -m  # bit hack, isolate the rightmost 1-bit
        a = reduce(operator.xor, (n for n in nums if n & m))
        return [a, ab ^ a]  # if a & m then not b & m

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.