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?
题目链接:https://leetcode.com/problems/single-number/
题目分析:异或的性质:a^a=0,a^0=a
public class Solution {
public int singleNumber(int[] nums) {
int ans = 0;
for (int i = 0; i < nums.length; i ++) {
ans ^= nums[i];
}
return ans;
}
}