public class Solution {
public int GetUglyNumber_Solution(int index) {
if(index==0)return 0;
int a[]=new int[index];
a[0]=1;
int p2=0;
int p3=0;
int p5=0;
for(int i=1;i<index;i++){
int minn=Math.min(Math.min(a[p2]*2,a[p3]*3),a[p5]*5);
a[i]=minn;
if(minn==a[p2]*2)p2++;///防止重复出现
if(minn==a[p3]*3)p3++;///防止重复出现
if(minn==a[p5]*5)p5++;///防止重复出现
}
return a[index-1];
}
}