Package g0201_0300.s0264_ugly_number_ii
Class Solution
java.lang.Object
g0201_0300.s0264_ugly_number_ii.Solution
264 - Ugly Number II.<p>Medium</p>
<p>An <strong>ugly number</strong> is a positive integer whose prime factors are limited to <code>2</code>, <code>3</code>, and <code>5</code>.</p>
<p>Given an integer <code>n</code>, return <em>the</em> <code>n<sup>th</sup></code> <em><strong>ugly number</strong></em>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> n = 10</p>
<p><strong>Output:</strong> 12</p>
<p><strong>Explanation:</strong> [1, 2, 3, 4, 5, 6, 8, 9, 10, 12] is the sequence of the first 10 ugly numbers.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> n = 1</p>
<p><strong>Output:</strong> 1</p>
<p><strong>Explanation:</strong> 1 has no prime factors, therefore all of its prime factors are limited to 2, 3, and 5.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= n <= 1690</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
nthUglyNumber
public int nthUglyNumber(int n)
-