LeetCode之旅（5）

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?

累死了。。可耻的找了个通过率最高的题欺负一下。。。

class Solution {
public:
    int singleNumber(int A[], int n) {
        int res = 0;
        for (int i=0; i<n; i++)
            res ^= A[i];
        return res;
    }
};