求数组里出现一次的数字~其他数字出现两次~

The problem:

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

int OnlyOnce(const int *a, int len)
{
	int x = a[0];
	for (int i = 1; i < len; i++ )
	{
		x ^= a[i];
	}

	return x;
}