260. single-number-iii, golang

description:

260. Single Number III
Medium
1088
86
Add to List
Share

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:
The order of the result is not important. So in the above example, [5, 3] is also correct.
Your algorithm should run in linear runtime complexity.
Could you implement it using only constant space complexity?

code:

func singleNumber(nums []int) []int {
    anRet := make([]int, 2)
    
    //get lowest bit site of 1
    lowestOneBit := 0
    for _, v := range nums {
        lowestOneBit ^= v
    }
    lowestOneBit &= ^lowestOneBit + 1
    
    //according lowestOneBit, separate nums into two arrays
    for _, v := range nums {
        if 0 == v & lowestOneBit {
            anRet[0] ^= v
        } else {
            anRet[1] ^= v
        }
    }//for _, v := range nums
    
    return anRet
    
}

result:

personal opinion:
thanks for the author of
https://www.cnblogs.com/grandyang/p/4741122.html