【整理】剑指offer——C++ 面试题3_1：数组中重复的数字

数据结构重点：数组，字符串，链表，树，栈及队列

在一个长度为n的数组里的所有数字都在0到n-1的范围内。数组中某些数字是重复的，但不知道有几个数字重复了，也不知道每个数字重复了几次。请找出数组中任意一个重复的数字。
例如，如果输入长度为7的数组{2, 3, 1, 0, 2, 5, 3}，那么对应的输出是重复的数字2或者3。

#include<cstdio>
//---------------------------------------------------------------
bool duplicate(int numbers[], int length, int* duplication){
	if (numbers == nullptr || length <= 0)
		return false;

	for (int i = 0; i < length; ++i)
	{
		if (numbers[i] < 0 || numbers[i] > length - 1)
			return false;
	}

	for (int i = 0; i < length; ++i)
	{
		while (numbers[i] != i)
		{
			if (numbers[i] == numbers[numbers[i]])
			{
				*duplication = numbers[i];
				return true;
			}

			int temp = numbers[i];
			numbers[i] = numbers[numbers[i]];
			numbers[temp] = temp;
		}
	}
	return false;
}

bool contains(int array[], int length, int number){
	for (int i = 0; i < length; ++i)
	{
		if (array[i] == number)
			return true;
	}
	return false;
}
//---------------------------------------------------------------
void test(char* testname, int numbers[], int lenhthnumbers, int expected[], int expectedExpected, bool validArgument){
	printf("%s begins:", testname);

	int duplication;
	bool validInput = duplicate(numbers, lenhthnumbers, &duplication);

	if (validArgument == validInput)
	{
		if (validArgument)
		{
			if (contains(expected, expectedExpected, duplication))
				printf("Passd. \n");
			else
				printf("Failed. \n");
		}
		else
			printf("Passd. \n");
	}
	else
		printf("Failed. \n");
}
//---------------------------------------------------------------
void test1(){
	int numbers[] = { 2, 1, 3, 1, 4 };
	int duplications[] = { 1 };
	test("Test1", numbers, sizeof(numbers) / sizeof(int), duplications, sizeof(duplications) / sizeof(int), true);
}

//---------------------------------------------------------------
void main(){
	test1();
}