题目
Given a non-empty 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?
Example 1:
Input: [2,2,1]
Output: 1
Example 2:
Input: [4,1,2,1,2]
Output: 4
代码
其核心在于，任何数和自身异或之后都为0
class Solution {
public int singleNumber(int[] nums) {
int result = 0;
for(int x:nums){
result ^=x;
}
return result;
}
}