数组中只出现一次的数字

题目描述

一个整型数组里除了两个数字之外，其他的数字都出现了两次。请写程序找出这两个只出现一次的数字。

#include <iostream>

using namespace std;

int FindFirst1(int num)
{
	int index = 0;

	while ((num & 1) == 0 && index < 8 * sizeof(int))
	{
		num = num >>1;
		index++;
	}
	
	return index;
}

bool IsBit1(int num, int index)
{
	num = num >> index;

	if((num & 1) == 1)
		return true;
	else
		return false;
}

void FindNumsAppearOnce(int* arr, int length, int *num1, int *num2)
{
	if(arr == NULL || length < 2)
		return;

	int AllNumNor = 0;

	for(int i = 0; i< length; i++)
		AllNumNor ^= arr[i];

	int indexOf1 = FindFirst1(AllNumNor);

	*num1 = 0;
	*num2 = 0;
	for(int i = 0; i < length; i++)
	{
		if(IsBit1(arr[i], indexOf1))
		{
			*num1 ^= arr[i]; 
		}else
		{
			*num2 ^= arr[i];
		}
	}
}

// ====================测试代码====================
void Test(char* testName, int data[], int length, int expected1, int expected2)
{
    if(testName != NULL)
        printf("%s begins: ", testName);

    int result1, result2;
    FindNumsAppearOnce(data, length, &result1, &result2);

    if((expected1 == result1 && expected2 == result2) ||
        (expected2 == result1 && expected1 == result2))
        printf("Passed.\n\n");
    else
        printf("Failed.\n\n");
}

void Test1()
{
    int data[] = {2, 4, 3, 6, 3, 2, 5, 5};
    Test("Test1", data, sizeof(data) / sizeof(int), 4, 6);
}

void Test2()
{
    int data[] = {4, 6};
    Test("Test2", data, sizeof(data) / sizeof(int), 4, 6);
}

void Test3()
{
    int data[] = {4, 6, 1, 1, 1, 1};
    Test("Test3", data, sizeof(data) / sizeof(int), 4, 6);
}

int main(int argc, char* argv[])
{
    Test1();
    Test2();
    Test3();

    return 0;
}