【latched】Single Number II

Problem

Code

int singleNumber(int* nums, int numsSize) {
    int tmp = 0;
    for(int i=1;i<numsSize;++i){
        tmp = nums[0] & (tmp ^ nums[i]);
        nums[0] = tmp | (nums[0] ^ nums[i]);
    }
    return nums[0];
}

Comment

      This is not my idea,but it is so brilliant.Shamefully…I have not figured out it…