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?
Subscribe to see which companies asked this question.
Solution:
Tips:
XOR
Java Code:
public class Solution {
public int singleNumber(int[] nums) {
int result = 0;
for (int i : nums) {
result ^= i;
}
return result;
}
}