mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 23:41:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 5777,
|
||||
"likes": 5779,
|
||||
"dislikes": 290,
|
||||
"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}]",
|
||||
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"325.9K\", \"totalSubmission\": \"706K\", \"totalAcceptedRaw\": 325901, \"totalSubmissionRaw\": 705977, \"acRate\": \"46.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"325.9K\", \"totalSubmission\": \"706K\", \"totalAcceptedRaw\": 325934, \"totalSubmissionRaw\": 706038, \"acRate\": \"46.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.",
|
||||
|
Reference in New Issue
Block a user