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

存量题库数据更新

Browse Source
This commit is contained in:
小墨
2023-12-09 18:42:21 +08:00
parent a788808cd7
commit c198538f10
10843 changed files with 288489 additions and 248355 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
leetcode/originData/minimum-increment-operations-to-make-array-beautiful.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 215,
"dislikes": 14,
"likes": 260,
"dislikes": 16,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[2,3,0,0,2]\n4\n[0,1,3,3]\n5\n[1,1,2]\n1",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"9K\", \"totalSubmission\": \"28.4K\", \"totalAcceptedRaw\": 8995, \"totalSubmissionRaw\": 28422, \"acRate\": \"31.6%\"}",
"stats": "{\"totalAccepted\": \"11.1K\", \"totalSubmission\": \"33.5K\", \"totalAcceptedRaw\": 11143, \"totalSubmissionRaw\": 33520, \"acRate\": \"33.2%\"}",
"hints": [
"There needs to be at least one value among <code>3</code> consecutive values in the array that is greater than or equal to <code>k</code>.",
"The problem can be solved using dynamic programming.",