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/maximum-number-of-eaten-apples.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 481,
"dislikes": 143,
"likes": 493,
"dislikes": 145,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[1,2,3,5,2]\n[3,2,1,4,2]\n[3,0,0,0,0,2]\n[3,0,0,0,0,2]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"13.9K\", \"totalSubmission\": \"38.4K\", \"totalAcceptedRaw\": 13925, \"totalSubmissionRaw\": 38393, \"acRate\": \"36.3%\"}",
"stats": "{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"39K\", \"totalAcceptedRaw\": 14192, \"totalSubmissionRaw\": 38967, \"acRate\": \"36.4%\"}",
"hints": [
"It's optimal to finish the apples that will rot first before those that will rot last",
"You need a structure to keep the apples sorted by their finish time"