iven 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 n = nums[0];
for(int i = 1;i < nums.length;i++){
n = n ^ nums[i];
}
return n;
}
}