0264-ugly-number-ii.adoc

264. Ugly Number II

{leetcode}/problems/ugly-number-ii/[LeetCode - Ugly Number II^]

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. 1 is typically treated as an ugly number.

2. n does not exceed 1690.

link:{sourcedir}/_0264_UglyNumberII.java[role=include]