coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-04 06:51:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
leetcode-cn/problem (Chinese)/丑数 [chou-shu-lcof].html
View File

@@ -1,18 +1,24 @@
<p>我们把只包含质因子 2、3 和 5 的数称作丑数（Ugly Number）。求按从小到大的顺序的第 n 个丑数。</p>
<p>给你一个整数 <code>n</code> ，请你找出并返回第 <code>n</code> 个 丑数 。</p>
<p><strong>说明：</strong>丑数是只包含质因数 2、3 和/或 5 的正整数；1 是丑数。</p>
<p>&nbsp;</p>
<p><strong>示例:</strong></p>
<p><strong>示例 1：</strong></p>
<pre><strong>输入:</strong> n = 10
<pre>
<strong>输入:</strong> n = 10
<strong>输出:</strong> 12
<strong>解释: </strong><code>1, 2, 3, 4, 5, 6, 8, 9, 10, 12</code> 是前 10 个丑数。</pre>
<p><strong>说明:&nbsp;</strong>&nbsp;</p>
<p><b>提示：</b>&nbsp;</p>
<ol>
<li><code>1</code>&nbsp;是丑数。</li>
<li><code>n</code>&nbsp;<strong>不超过</strong>1690。</li>
</ol>
<ul>
<li><code>1 &lt;= n&nbsp;&lt;=<b>&nbsp;</b>1690</code></li>
</ul>
<p>&nbsp;</p>
<p>注意：本题与主站 264 题相同：<a href="https://leetcode-cn.com/problems/ugly-number-ii/">https://leetcode-cn.com/problems/ugly-number-ii/</a></p>
<p>&nbsp;</p>