【LeetCode】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?

因为题目要求linear runtime complexity跟不允许有extra memory，考虑用亦或操作来实现。

0^a = a;
a^a = 0;

public class Solution {
    public int singleNumber(int[] A) {
        int result = 0;
        for(int i = 0; i < A.length;i++)
        {
            result = result ^ A[i];
        }
        return result;
    }
}