题目:题目:我们把只包含因子2、3和5的数称作丑数(Ugly Number)。求按从小到大的顺序的第1500个丑数。例如6、8都是丑数,但14不是,因为它包含因子7。习惯上我们把1当做第一个丑数。
——来源于《剑指offer》
- 代码实现:
import java.util.*;
/**
* @author lijing
* @date 2019-09-27 20:31
* @description
*/
public class Solution {
public int GetUglyNumber_Solution(int index) {
if (index < 0) {
throw new RuntimeException("invalid parameters");
}
if (index < 7) {
return index;
}
int p2 = 0, p3 = 0, p5 = 0, uglyNum = 1;
ArrayList<Integer> list = new ArrayList<>();
list.add(uglyNum);
while (list.size() < index) {
Integer v2 = list.get(p2) * 2;
Integer v3 = list.get(p3) * 3;
Integer v5 = list.get(p5) * 5;
uglyNum = Math.min(v2, Math.min(v3, v5));
list.add(uglyNum);
if (uglyNum == v2) {
p2++;
}
if (uglyNum == v3) {
p3++;
}
if (uglyNum == v5) {
p5++;
}
}
return uglyNum;
}
public static void main(String[] args) {
System.out.println(new Solution().GetUglyNumber_Solution(1500));
}
}