Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you have been placed in read-only mode.

Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).

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

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