[LeetCode] Single Number

Given an array of integers, every element appears twice except for one. Find that single one.

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