1. 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?
代码：
|
1
2
3
4
5
6
7
8
9
10 |
class
Solution {public: int
singleNumber(int
A[], int
n) { int
result = 0; for(int
i = 0; i < n; ++i){ result ^= A[i]; } return
result; }}; |
4.Single Number （II）,布布扣,bubuko.com
原文：http://www.cnblogs.com/liyangguang1988/p/3622257.html