Description
Write a program to find the n-th ugly number.
Ugly numbers are positive numbers whose prime factors only include 2, 3, 5.
Example:
Input: n = 10
Output: 12
Explanation: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first 10 ugly numbers.
Note:
1 is typically treated as an ugly number.
n does not exceed 1690.
Solution
解法1:
生成所有ugly number,使用最小堆来维护有序性,并用hashset来去重。缺点是,无法避免重复计算,最重要的缺点是会插入不需要用到的数字(维护最小堆比较花时间)
public int nthUglyNumber(int n) {
PriorityQueue<Double> pq = new PriorityQueue<>();
Set<Double> set = new HashSet<>();
pq.offer((double) 1