ugly-number-ii

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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

Given an integer <code>n</code>, return the <code>nth</code> ugly number.

&nbsp;
Example 1:

<pre>
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.
</pre>

Example 2:

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

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 1690</code></li>
</ul>

nthUglyNumber

Ugly Number II

Merge k Sorted Lists

merge-k-sorted-lists

合并 K 个升序链表

Count Primes

count-primes

计数质数

Ugly Number

ugly-number

丑数

Perfect Squares

perfect-squares

完全平方数

Super Ugly Number

super-ugly-number

超级丑数

Ugly Number III

ugly-number-iii

丑数 III

Hash Table

Math

Dynamic Programming

Heap (Priority Queue)

给你一个整数 <code>n</code> ，请你找出并返回第 <code>n</code> 个 丑数 。

丑数 就是质因子只包含&nbsp;<code>2</code>、<code>3</code> 和&nbsp;<code>5</code>&nbsp;的正整数。

&nbsp;

示例 1：

<pre>
输入：n = 10
输出：12
解释：[1, 2, 3, 4, 5, 6, 8, 9, 10, 12] 是由前 10 个丑数组成的序列。
</pre>

示例 2：

<pre>
输入：n = 1
输出：1
解释：1 通常被视为丑数。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n &lt;= 1690</code></li>
</ul>