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

6
leetcode/originData/kids-with-the-greatest-number-of-candies.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Easy",
"likes": 1478,
"dislikes": 266,
"likes": 1523,
"dislikes": 270,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[2,3,5,1,3]\n3\n[4,2,1,1,2]\n1\n[12,1,12]\n10",
@@ -137,7 +137,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"299.5K\", \"totalSubmission\": \"341.3K\", \"totalAcceptedRaw\": 299536, \"totalSubmissionRaw\": 341333, \"acRate\": \"87.8%\"}",
"stats": "{\"totalAccepted\": \"304.4K\", \"totalSubmission\": \"347K\", \"totalAcceptedRaw\": 304390, \"totalSubmissionRaw\": 347033, \"acRate\": \"87.7%\"}",
"hints": [
"Use greedy approach. For each kid check if candies[i] + extraCandies ≥ maximum in Candies[i]."
],