算法-Find that single one

Description

Given an array of integers, every element appears twice except for one. Find that single one.

Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?

 public class Solution {
     public int singleNumber(int[] nums) {
         
         int temp = 0;
         for (int i=0;i<nums.length;i++)
         {
             temp = temp^nums[i];
         }
         return temp;
    }
}

C

Solution

相异为1；找到相等的部分；为1的部分是不同的。

如：1 1 2 2 3 3 4 ，前三对异或为0，0和4异或为4。