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-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

8
leetcode/originData/minimum-increment-to-make-array-unique.json
View File

@@ -11,10 +11,10 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 990,
"dislikes": 43,
"likes": 1038,
"dislikes": 44,
"isLiked": null,
"similarQuestions": "[]",
"similarQuestions": "[{\"title\": \"Maximum Product After K Increments\", \"titleSlug\": \"maximum-product-after-k-increments\", \"difficulty\": \"Medium\", \"translatedTitle\": null}]",
"exampleTestcases": "[1,2,2]\n[3,2,1,2,1,7]",
"categoryTitle": "Algorithms",
"contributors": [],
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"51.6K\", \"totalSubmission\": \"105.5K\", \"totalAcceptedRaw\": 51594, \"totalSubmissionRaw\": 105463, \"acRate\": \"48.9%\"}",
"stats": "{\"totalAccepted\": \"52.7K\", \"totalSubmission\": \"107.4K\", \"totalAcceptedRaw\": 52672, \"totalSubmissionRaw\": 107398, \"acRate\": \"49.0%\"}",
"hints": [],
"solution": {
"id": "624",