update

leetcode-cn/originData/ugly-number-ii.json

@@ -12,7 +12,7 @@
             "translatedContent": "<p>给你一个整数 <code>n</code> ，请你找出并返回第 <code>n</code> 个 <strong>丑数</strong> 。</p>\n\n<p><strong>丑数 </strong>就是只包含质因数 <code>2</code>、<code>3</code> 和/或 <code>5</code> 的正整数。</p>\n\n<p> </p>\n\n<p><strong>示例 1：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = 10\n<strong>输出：</strong>12\n<strong>解释：</strong>[1, 2, 3, 4, 5, 6, 8, 9, 10, 12] 是由前 10 个丑数组成的序列。\n</pre>\n\n<p><strong>示例 2：</strong></p>\n\n<pre>\n<strong>输入：</strong>n = 1\n<strong>输出：</strong>1\n<strong>解释：</strong>1 通常被视为丑数。\n</pre>\n\n<p> </p>\n\n<p><strong>提示：</strong></p>\n\n<ul>\n\t<li><code>1 <= n <= 1690</code></li>\n</ul>\n",
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 870,
+            "likes": 872,
             "dislikes": 0,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Merge k Sorted Lists\", \"titleSlug\": \"merge-k-sorted-lists\", \"difficulty\": \"Hard\", \"translatedTitle\": \"\\u5408\\u5e76K\\u4e2a\\u5347\\u5e8f\\u94fe\\u8868\"}, {\"title\": \"Count Primes\", \"titleSlug\": \"count-primes\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u8ba1\\u6570\\u8d28\\u6570\"}, {\"title\": \"Ugly Number\", \"titleSlug\": \"ugly-number\", \"difficulty\": \"Easy\", \"translatedTitle\": \"\\u4e11\\u6570\"}, {\"title\": \"Perfect Squares\", \"titleSlug\": \"perfect-squares\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u5b8c\\u5168\\u5e73\\u65b9\\u6570\"}, {\"title\": \"Super Ugly Number\", \"titleSlug\": \"super-ugly-number\", \"difficulty\": \"Medium\", \"translatedTitle\": \"\\u8d85\\u7ea7\\u4e11\\u6570\"}]",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"119.3K\", \"totalSubmission\": \"204.6K\", \"totalAcceptedRaw\": 119314, \"totalSubmissionRaw\": 204565, \"acRate\": \"58.3%\"}",
+            "stats": "{\"totalAccepted\": \"119.6K\", \"totalSubmission\": \"205.1K\", \"totalAcceptedRaw\": 119609, \"totalSubmissionRaw\": 205082, \"acRate\": \"58.3%\"}",
             "hints": [
                 "The naive approach is to call <code>isUgly</code> for every number until you reach the n<sup>th</sup> one. Most numbers are <i>not</i> ugly. Try to focus your effort on generating only the ugly ones.",
                 "An ugly number must be multiplied by either 2, 3, or 5 from a smaller ugly number.",