#264

Ugly Number II

specialist · 880 · lc medium +31 · verified · 49.5% accepted · 6,850 likes · top 36%

⚑ Merge K Sorted Structures ⚑ Sieve of Eratosthenes

Description

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

Given an integer n, find and return the n-th ugly number in the sequence.

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.

Code

1

2

3

class Solution:
    def nthUglyNumber(self, n: int) -> int:

class Solution:
    def nthUglyNumber(self, n: int) -> int: