Project Euler 14 Longest Collatz sequence

Project Euler 14 Longest Collatz sequence

问题

The following iterative sequence is defined for the set of positive integers:
n → n/2 (n is even)
n → 3n + 1 (n is odd)

Using the rule above and starting with 13, we generate the following sequence:
13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1
It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.

Which starting number, under one million, produces the longest chain?
NOTE: Once the chain starts the terms are allowed to go above one million.

思路

可以使用递归或者循环来进行求解

递归法

#include <iostream
#include <stdlib.h>
#include<Windows.h>       // 统计时间

unsigned int  CollatzLength(unsigned int number)  //使用递归计算步长
{
	if (number == 1)
	{
		return 1;
	}
	if (number % 2 == 0)
	{
		return CollatzLength(number / 2) + 1;
	}
	else
	{
		return CollatzLength(number * 3 + 1) + 1;
	}
}

unsigned int CollatzSequenceRecursion(unsigned int maxNumber)
{
	unsigned int collatzIndex = 1;
	unsigned int collatzLength = 1;
	unsigned int maxLength = 0;
	unsigned int maxCollatzNumber = 0;
	
	unsigned int startTime = GetTickCount();  //统计时间

	for (unsigned int i = 1; i <= maxNumber; i++)
	{
		collatzIndex = i;
		collatzLength = CollatzLength(i);
		if (collatzLength > maxLength)
		{
			maxLength = collatzLength;
			maxCollatzNumber = i;
		}
	}

	unsigned int endTime = GetTickCount();  //统计时间
	unsigned int delayTime = endTime - startTime;

	printf("The max length is %d of the number %d \n", maxLength, maxCollatzNumber);
	printf("The delay time is %d ms of the recursion algorithm\n\n", delayTime);
	return 0;
}
int main() 
{
	CollatzSequenceRecursion(1000000);
	system("pause");
	return 0;
}

循环法

#include <iostream
#include <stdlib.h>
#include<Windows.h>       // 统计时间

unsigned int SequenceCalculate(unsigned int number)
{
	unsigned int collatzCount = 1;
	while (number != 1)
	{
		if (number % 2 == 0)
		{
			number /= 2;
			collatzCount++;
		}
		else
		{
			number = 3 * number + 1;
			collatzCount++;
		}
	}
	return collatzCount;
}


unsigned int CollatzSequenceCirculate(unsigned int numberForCollatz)
{
	unsigned int maxLength = 0;
	unsigned int maxCollatzNumber = 0;
	unsigned int collatzIndex = 1;
	unsigned int collatzLength = 1;

	unsigned int startTime = GetTickCount();

	for (unsigned int i = 1; i < numberForCollatz; i++)
	{
		collatzIndex = i;

		collatzLength = SequenceCalculate(i);
		if (collatzLength > maxLength)
		{
			maxLength = collatzLength;
			maxCollatzNumber = i;
		}
	}
	unsigned int endTime = GetTickCount();
	unsigned int delayTime = endTime - startTime;

	printf("The max length is %d of the number %d \n", maxLength, maxCollatzNumber);
	printf("The delay time is %d ms of the circulate algorithm\n\n", delayTime);
	return 0;
}

int main() 
{
	CollatzSequenceCirculate(1000000);
	system("pause");
	return 0;
}

结果

可以看出，使用循环所使用的时间为640ms而递归所花费的时间为2766ms,结果一致，均为837799

最后

该作者的记忆化求解法也很值得借鉴，附上链接https://blog.csdn.net/qq_38362049/article/details/80916275