找到一组数两个不重复的数字

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
void FindtowNum(int* arr, int size)
{
int getbit = 0;
for (int i = 0;i < size;i++)
{
getbit ^= arr[i];
}
int pos = 1;
for (int i = 0;i < 32;i++)
{
if (pos && getbit != 0)
break;
pos <<= 1;
}
int num1 = 0;
int num2 = 0;
for (int i = 0;i < size;i++)
{
if (arr[i] & pos != 0)
{
num1 ^= arr[i];
}
else
num2 ^= arr[i];
}
printf("%d %d", num1, num2);
}
int main()
{
int arr[] = { 1,1,2,2,3,3,4,5 };
FindtowNum(arr, sizeof(arr) / sizeof(*arr));
printf("\n");
system(“pause”);
}