剑指offer35 丑数

import java.util.Arrays;

public class Test{
public static int[] findNum(int n) {
if(n<0) {
return null;
}
int[] uglyNum=new int[n];
uglyNum[0]=1;
int mul2=1;
int mul3=1;
int mul5=1;
for(int i=1;i<uglyNum.length;i++) {
int min=Math.min(Math.min(mul22, mul33), mul55);
uglyNum[i]=min;
while(mul22<=min) {
mul2++;
}
while(mul33<=min) {
mul3++;
}
while(mul55<=min) {
mul5++;
}
}
return uglyNum;
}
public static void main(String[] args) {
System.out.println(Arrays.toString(findNum(1500)));

}

}