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?
Java:
public static int singleNumber(int[] A) {
int x = 0;
for (int a : A) {
x = x ^ a;
}
return x;
}
本文介绍了一种线性时间复杂度的算法来找出数组中只出现一次的元素,该算法不使用额外内存,通过位操作实现。


被折叠的 条评论
为什么被折叠?



