题目描述
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?
解题思路:
- once记录出现一次
- 遍历数组 记当前值为t
- once ^= t
- 遍历完 返回once
public class Solution {
public int singleNumber(int[] A) {
int once = 0;
for (int i = 0; i < A.length; i++) {
once ^= A[i];
}
return once;
}
}