把只包含因子2,3,5的数称作丑数。求按从小到大的顺序的第1500个丑数。
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 GetUglyNumber_1(int index)
{
if(index <= 0)
return 0;
int number = 0;
int uglyFound = 0;
while(uglyFound < index)
{
++number;
if(IsUgly(number))
{
++uglyFound;
}
}
return number;
}
int Min(int number1,int number2,int number3)
{
int min = (number1 < number2) ? number1:number2;
min = (min < number3)? min:number3;
return min;
}
int GetUglyNumber_2(int index)
{
if(index <= 0)
return 0;
int *pUglyNumbers = new int[index];
pUglyNumbers[0] = 1;
int nextUglyIndex = 1;
int *pMultiply2 = pUglyNumbers;
int *pMultiply3 = pUglyNumbers;
int *pMultiply5 = pUglyNumbers;
while(nextUglyIndex < index)
{
int min = Min(*pMultiply2*2,*pMultiply3*3,*pMultiply5*5);
pUglyNumbers[nextUglyIndex] = min;
while(*pMultiply2*2 <= pUglyNumbers[nextUglyIndex])
++pMultiply2;
while(*pMultiply3*3 <= pUglyNumbers[nextUglyIndex])
++pMultiply3;
while(*pMultiply5*5 <= pUglyNumbers[nextUglyIndex])
++pMultiply5;
++nextUglyIndex;
}
int ugly = pUglyNumbers[nextUglyIndex-1];
delete [] pUglyNumbers;
return ugly;
}
void Test(int index, int expected)
{
if(GetUglyNumber_1(index) == expected)
printf("solution1 passed\n");
else
printf("solution1 failed\n");
if(GetUglyNumber_2(index) == expected)
printf("solution2 passed\n");
else
printf("solution2 failed\n");
}
int main( )
{
Test(1, 1);
Test(2, 2);
Test(3, 3);
Test(4, 4);
Test(5, 5);
Test(6, 6);
Test(7, 8);
Test(8, 9);
Test(9, 10);
Test(10, 12);
Test(11, 15);
Test(1500, 859963392);
Test(0, 0);
return 0;
}