package sort;
public class Test49 {
public static void main(String[] args) {
System.out.println(uglynumber(1500));
}
public static int uglynumber(int n) {
if (n < 6) {
return n;
}
int[] store = new int[n + 1];
store[1] = 1;
int p2 = 1;//三个指针,
int p3 = 1;
int p5 = 1;
for (int i = 2; i < n + 1; i++) {//分别p2所指X2,p3所指X3,P5所指X5,求三者最小
int min = Math.min(store[p2] * 2, store[p3] * 3);
min = Math.min(min, store[p5] * 5);
store[i] = min;
while (min >= store[p2] * 2)
p2++;
while (min >= store[p3] * 3)
p3++;
while (min >= store[p5] * 5)
p5++;
System.out.println(store[i]);
}
return store[n];
}
}