单身狗2

void Finf_single_dog2(int arr[], int sz)
{
	//全部异或
	int ret = 0;
	int i = 0;
	for (i = 0; i < sz; i++)
	{
		ret ^= arr[i];
	}
	//计算ret的第几位是1；得到i
	int pos = 0;
	for (i = 0; i < 32; i++)
	{
		if (((ret >> i) & 1) == 1)
		{
			pos = i;
			break;
		}
	}
	//分组
	int s1 = 0;
	int s2 = 0;
	for (i = 0; i < sz; i++)
	{
		if (((arr[i] >> pos) & 1) == 1)
		{
			s1 ^= arr[i];
		}
		else
		{
			s2 ^= arr[i];
		}
	}
	printf("%d %d", s1, s2);
}
int main()
{
	int arr[] = { 1,2,3,4,5,1,2,3,4,6 };
	int sz = sizeof(arr) / sizeof(arr[0]);
	Finf_single_dog2(arr, sz);
	return 0;
}