1
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
This commit is contained in:
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 736,
"dislikes": 388,
"likes": 757,
"dislikes": 396,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Ugly Number II\", \"titleSlug\": \"ugly-number-ii\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "3\n2\n3\n5\n4\n2\n3\n4\n5\n2\n11\n13",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"19K\", \"totalSubmission\": \"68.5K\", \"totalAcceptedRaw\": 18954, \"totalSubmissionRaw\": 68494, \"acRate\": \"27.7%\"}",
"stats": "{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"70.1K\", \"totalAcceptedRaw\": 19443, \"totalSubmissionRaw\": 70110, \"acRate\": \"27.7%\"}",
"hints": [
"Write a function f(k) to determine how many ugly numbers smaller than k. As f(k) is non-decreasing, try binary search.",
"Find all ugly numbers in [1, LCM(a, b, c)] (LCM is Least Common Multiple). Use inclusion-exclusion principle to expand the result."