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/find-the-student-that-will-replace-the-chalk.json
View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 211,
"dislikes": 34,
"likes": 255,
"dislikes": 37,
"isLiked": null,
"similarQuestions": "[]",
"exampleTestcases": "[5,1,5]\n22\n[3,4,1,2]\n25",
@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"15.5K\", \"totalSubmission\": \"38.2K\", \"totalAcceptedRaw\": 15524, \"totalSubmissionRaw\": 38190, \"acRate\": \"40.6%\"}",
"stats": "{\"totalAccepted\": \"17.3K\", \"totalSubmission\": \"41.6K\", \"totalAcceptedRaw\": 17276, \"totalSubmissionRaw\": 41596, \"acRate\": \"41.5%\"}",
"hints": [
"Subtract the sum of chalk[i] from k until k is less than that sum",
"Now just iterate over the array if chalk[i] is less thank k this is your answer otherwise this i is the answer"