2015年8月20日20:25:45 丑数IsUgly

<pre name="code" class="cpp">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;
}

//o(n^2)
int GetUglyNumber_Solution2(int index)
{
	if(index<=0) return 0;
	
	int *pUglyNumbers =new int [index];
	pUglyNumbers[0];
	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<=pMultiply[nextUglyIndex])
			++pMultiply2;
		while(*pMultiply3*3<=pMultiply[nextUglyIndex])
			++pMultiply3;
		while(*pMultiply5*5<=pMultiply[nextUglyIndex])
			++pMultiply5;
			
			++nextUglyIndex;
	}
	int ugly =pUglyNumbers[nextUglyIndex-1];
	delete[] pUglyNumbers;a
	return ugly;

}

int Min(int number1,int number2,int number3)
{
	int min=(number1<number2)?number1:number2;
	min=(min<number3)?min:number3;

	return min;
}

//1500 UglyNumber Arryay,consume 6KB memery.
//<o(n^2)