题目:
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?
异或运算符即可解决
class Solution {
public int singleNumber(int[] nums) {
int result = 0;
for(int num:nums){
result = result ^ num;
}
return result;
}
}