mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-10-22 05:26:46 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"5.4K\", \"totalSubmission\": \"7.9K\", \"totalAcceptedRaw\": 5431, \"totalSubmissionRaw\": 7863, \"acRate\": \"69.1%\"}",
|
||||
"stats": "{\"totalAccepted\": \"5.5K\", \"totalSubmission\": \"7.9K\", \"totalAcceptedRaw\": 5458, \"totalSubmissionRaw\": 7903, \"acRate\": \"69.1%\"}",
|
||||
"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