coder-xiaomo/leetcode-problemset
1
0
Fork 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

update

Browse Source
This commit is contained in:
小墨
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 2641,
"likes": 2643,
"dislikes": 322,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Maximize Number of Nice Divisors\", \"titleSlug\": \"maximize-number-of-nice-divisors\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -143,7 +143,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"179.7K\", \"totalSubmission\": \"333.6K\", \"totalAcceptedRaw\": 179677, \"totalSubmissionRaw\": 333579, \"acRate\": \"53.9%\"}",
"stats": "{\"totalAccepted\": \"180K\", \"totalSubmission\": \"334K\", \"totalAcceptedRaw\": 179956, \"totalSubmissionRaw\": 333978, \"acRate\": \"53.9%\"}",
"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."