丑数

题目：我们把只包含因子2、3、和5的数称作丑数（Ugly Number）。求按从小到大的顺序的第1500个丑数。例如6、8都是丑数，但14不是，因为它包含因子7.习惯上我们把1当做第一个丑数。

bool isUgly(int number);
int min(int num1, int num2, int num3);
bool InvalidInput = false;
//逐个判断每个整数是不是丑数的解法，直观但不够高效
int UglyNumber_Solution1(int index)
{
	int nextIndex=1;
	long UglyNumber = 1;
	while (nextIndex < index)
	{
		UglyNumber++;
		if (isUgly(UglyNumber))
		{
			nextIndex++;
		}
	}
	return UglyNumber;
}
bool isUgly(int number)
{
	while (number % 2 == 0)
		number /= 2 ;
	while (number % 3 == 0)
		number /= 3;
	while (number % 5 == 0)
		number /= 5;
	return (number == 1 )? true:false;
}
//创建数组保存已经找到的丑数，用空间换时间的解法
int UglyNumber_Solution2(int index)
{
	if (index <= 0)
	{
		InvalidInput = true;
		return 0;
	}	
	int *UglyNumbers= new int[index];
		UglyNumbers[0] = 1;
	int NextIndex = 1;
	int *pMultiply2 = UglyNumbers;
	int *pMultiply3 = UglyNumbers;
	int *pMultiply5 = UglyNumbers;
	while (NextIndex < index)
	{
		UglyNumbers[NextIndex] = min(*pMultiply2 * 2, *pMultiply3 * 3, *pMultiply5 * 5);
		while (*pMultiply2*2<= UglyNumbers[NextIndex])
			pMultiply2++;
		while (*pMultiply3*3 <= UglyNumbers[NextIndex])
			pMultiply3++;
		while (*pMultiply5*5 <= UglyNumbers[NextIndex])
			pMultiply5++;
		NextIndex++;
	}
	int result = UglyNumbers[NextIndex - 1];
	delete []UglyNumbers;
	return result;
}
int min(int num1, int num2, int num3)
{
	int min = num1<num2 ? num1 : num2;
	min = min < num3 ? min : num3;
	return min;
}
void test()
{
	printf("8888888888 UglyNumber_Solution1 888888888\n");
	printf("UglyNumber(4) = %d\n", UglyNumber_Solution1(4));
	printf("UglyNumber(10) = %d\n", UglyNumber_Solution1(10));
	printf("UglyNumber(1500) = %d\n", UglyNumber_Solution1(1500));
	printf("8888888888 UglyNumber_Solution2 888888888\n");
	printf("UglyNumber(4) = %d\n", UglyNumber_Solution2(4));
	printf("UglyNumber(10) = %d\n", UglyNumber_Solution2(10));
	printf("UglyNumber(1500) = %d\n", UglyNumber_Solution2(1500));
}
int _tmain(int argc, _TCHAR* argv[])
{
	test();
	return 0;
}