leetcode 只出现一次的数

本题用到离散数学方面知识

int singleNumber(int* nums, int numsSize)
{
    unsigned one = 0, two = 0;
    for (int i = 0; i < numsSize; i++)
    {
        one = (one ^ nums[i]) & (~two);
        two = (two ^ nums[i]) & (~one);
    }
	return one;
}