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

update

Browse Source
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
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/integer-break.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 2643,
"dislikes": 322,
"likes": 2715,
"dislikes": 325,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximize Number of Nice Divisors\", \"titleSlug\": \"maximize-number-of-nice-divisors\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "2\n10",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"180K\", \"totalSubmission\": \"334K\", \"totalAcceptedRaw\": 179956, \"totalSubmissionRaw\": 333978, \"acRate\": \"53.9%\"}",
"stats": "{\"totalAccepted\": \"183.7K\", \"totalSubmission\": \"339.6K\", \"totalAcceptedRaw\": 183654, \"totalSubmissionRaw\": 339601, \"acRate\": \"54.1%\"}",
"hints": [
"There is a simple O(n) solution to this problem.",
"You may check the breaking results of <i>n</i> ranging from 7 to 10 to discover the regularities."