Skip to content

Files

Latest commit

author
Shuo
Nov 19, 2021
5792575 · Nov 19, 2021

History

History

ugly-number-ii

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Nov 19, 2021
Nov 14, 2019
Nov 15, 2019

< Previous                  Next >

An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5.

Given an integer n, return the nth ugly number.

 

Example 1:

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.

Example 2:

Input: n = 1
Output: 1
Explanation: 1 has no prime factors, therefore all of its prime factors are limited to 2, 3, and 5.

 

Constraints:

  • 1 <= n <= 1690

Related Topics

[Hash Table] [Math] [Dynamic Programming] [Heap (Priority Queue)]

Similar Questions

  1. Merge k Sorted Lists (Hard)
  2. Count Primes (Medium)
  3. Ugly Number (Easy)
  4. Perfect Squares (Medium)
  5. Super Ugly Number (Medium)
  6. Ugly Number III (Medium)

Hints

Hint 1 The naive approach is to call isUgly for every number until you reach the nth one. Most numbers are not ugly. Try to focus your effort on generating only the ugly ones.
Hint 2 An ugly number must be multiplied by either 2, 3, or 5 from a smaller ugly number.
Hint 3 The key is how to maintain the order of the ugly numbers. Try a similar approach of merging from three sorted lists: L1, L2, and L3.
Hint 4 Assume you have Uk, the kth ugly number. Then Uk+1 must be Min(L1 * 2, L2 * 3, L3 * 5).