把只包含质因子2、3和5的数称作丑数(Ugly Number)。例如6、8都是丑数,但14不是,因为它包含质因子7。 习惯上我们把1当做是第一个丑数。求按从小到大的顺序的第N个丑数。
public class Solution {
List<Integer> list = new ArrayList<>();
public int GetUglyNumber_Solution(int index) {
if(index <= 0){
return 0;
}
list.add(1);
int i2=0,i3=0,i5=0;
while (list.size() < index){
int n2 = list.get(i2)*2;
int n3 = list.get(i3)*3;
int n5 = list.get(i5)*5;
int min = Math.min(n2,Math.min(n3,n5));
list.add(min);
if(min == n2){
i2++;
}
if(min == n3){
i3++;
}
if(min == n5){
i5++;
}
}
return list.get(index-1);
}
public boolean isUgly(int number) {
int temp = number;
while (number % 2 == 0) {
number /= 2;
if(list.contains(number)){
list.add(temp);
return true;
}
}
while (number % 3 == 0) {
number /= 3;
if(list.contains(number)){
list.add(temp);
return true;
}
}
while (number % 5 == 0) {
number /= 5;
if(list.contains(number)){
list.add(temp);
return true;
}
}
if(number == 1){
list.add(temp);
return true;
}else{
return false;
}
}
}