算法：求由2的k次方*3的k次方*5的k次方得到的第k个数

public class getUglyNumber_Solution2 {
public static void main(String[]args){
for(int i=1;i<=11;i++){
System.out.println(method(i));
}
}
public static int method(int index){
if(index<0)
return 0;
int[] uglyArray = new int[index];
uglyArray[0]=1;
int multiply2 = 0;
int multiply3 = 0;
int multiply5 = 0;
for(int i = 1;i<index;i++)
{
int min = min(uglyArray[multiply2] * 2, uglyArray[multiply3] * 3, uglyArray[multiply5] * 5);
uglyArray[i] = min;
while (uglyArray[multiply2] * 2 <= min)
multiply2++;
while (uglyArray[multiply3] * 3 <= min)
multiply3++;
while (uglyArray[multiply5] * 5 <= min)
multiply5++;
}
return uglyArray[index-1];
}


public static int min(int number1,int number2,int number3){    
     int min = (number1<number2)?number1:number2;    
     return min <number3?min:number3;    
}
}