Leetcode - 260. Single Number III (位运算)

Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.

Example:

Input:  [1,2,1,3,2,5]
Output: [3,5]

Note:

1. The order of the result is not important. So in the above example, [5, 3] is also correct.
2. Your algorithm should run in linear runtime complexity. Could you implement it using only constant space complexity?

def singleNumber(nums):

    tmp = 0
    for num in nums:
        tmp ^= num

    i = 0
    while tmp & 1 == 0:
        tmp >>= 1
        i +=1
   
    tmp = 1 << i

    first,second = 0,0

    for num in nums:
        if num & tmp:
            first ^= num
        else:
            second ^= num

    return [first,second]