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

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/find-the-student-that-will-replace-the-chalk.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"49K\", \"totalSubmission\": \"106.8K\", \"totalAcceptedRaw\": 49034, \"totalSubmissionRaw\": 106830, \"acRate\": \"45.9%\"}",
"stats": "{\"totalAccepted\": \"49K\", \"totalSubmission\": \"106.8K\", \"totalAcceptedRaw\": 49037, \"totalSubmissionRaw\": 106834, \"acRate\": \"45.9%\"}",
"hints": [
"Subtract the sum of chalk from k until k is less than the sum of chalk.",
"Now iterate over the array. If chalk[i] is less than k, this is the answer. Otherwise, subtract chalk[i] from k and continue."