LeetCode136——Single Number

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?

难度系数：

中等

实现

做了SingleNumberII之后，就发现这题实在是再简单不过了。

int singleNumber(int A[], int n) {
    int tmp = 0;
    for (int i = 0; i < n; i++) {
        tmp ^= A[i];
    }
    return tmp;
}