mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-07 00:11:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"43.5K\", \"totalSubmission\": \"71.5K\", \"totalAcceptedRaw\": 43549, \"totalSubmissionRaw\": 71535, \"acRate\": \"60.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"43.6K\", \"totalSubmission\": \"71.5K\", \"totalAcceptedRaw\": 43558, \"totalSubmissionRaw\": 71547, \"acRate\": \"60.9%\"}",
|
||||
"hints": [
|
||||
"If we consider costs from high to low, what is the maximum cost of a single candy that we can get for free?",
|
||||
"How can we generalize this approach to maximize the costs of the candies we get for free?",
|
||||
|
Reference in New Issue
Block a user