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:
小墨
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/originData/minimum-amount-of-time-to-fill-cups.json
View File

@@ -161,7 +161,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"42.2K\", \"totalSubmission\": \"73.8K\", \"totalAcceptedRaw\": 42225, \"totalSubmissionRaw\": 73751, \"acRate\": \"57.3%\"}",
"stats": "{\"totalAccepted\": \"42.3K\", \"totalSubmission\": \"73.8K\", \"totalAcceptedRaw\": 42270, \"totalSubmissionRaw\": 73842, \"acRate\": \"57.2%\"}",
"hints": [
"To minimize the amount of time needed, you want to fill up as many cups as possible in each second. This means that you want to maximize the number of seconds where you are filling up two cups.",
"You always want to fill up the two types of water with the most unfilled cups."