update

leetcode/originData/ugly-number-ii.json

@@ -11,8 +11,8 @@
             "translatedContent": null,
             "isPaidOnly": false,
             "difficulty": "Medium",
-            "likes": 3865,
-            "dislikes": 205,
+            "likes": 3966,
+            "dislikes": 210,
             "isLiked": null,
             "similarQuestions": "[{\"title\": \"Merge k Sorted Lists\", \"titleSlug\": \"merge-k-sorted-lists\", \"difficulty\": \"Hard\", \"translatedTitle\": null}, {\"title\": \"Count Primes\", \"titleSlug\": \"count-primes\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Ugly Number\", \"titleSlug\": \"ugly-number\", \"difficulty\": \"Easy\", \"translatedTitle\": null}, {\"title\": \"Perfect Squares\", \"titleSlug\": \"perfect-squares\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Super Ugly Number\", \"titleSlug\": \"super-ugly-number\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"title\": \"Ugly Number III\", \"titleSlug\": \"ugly-number-iii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
             "exampleTestcases": "10\n1",
@@ -155,7 +155,7 @@
                     "__typename": "CodeSnippetNode"
                 }
             ],
-            "stats": "{\"totalAccepted\": \"252.4K\", \"totalSubmission\": \"559.5K\", \"totalAcceptedRaw\": 252441, \"totalSubmissionRaw\": 559508, \"acRate\": \"45.1%\"}",
+            "stats": "{\"totalAccepted\": \"255.9K\", \"totalSubmission\": \"565.8K\", \"totalAcceptedRaw\": 255919, \"totalSubmissionRaw\": 565847, \"acRate\": \"45.2%\"}",
             "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.",