mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
update
This commit is contained in:
@@ -11,8 +11,8 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 317,
|
||||
"dislikes": 133,
|
||||
"likes": 325,
|
||||
"dislikes": 138,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[]",
|
||||
"exampleTestcases": "[1,3,2,4,1]\n7\n[10,6,8,7,7,8]\n5\n[1,6,3,1,2,5]\n20",
|
||||
@@ -137,7 +137,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"30.8K\", \"totalSubmission\": \"47.5K\", \"totalAcceptedRaw\": 30763, \"totalSubmissionRaw\": 47466, \"acRate\": \"64.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"31.4K\", \"totalSubmission\": \"48.5K\", \"totalAcceptedRaw\": 31416, \"totalSubmissionRaw\": 48487, \"acRate\": \"64.8%\"}",
|
||||
"hints": [
|
||||
"It is always optimal to buy the least expensive ice cream bar first.",
|
||||
"Sort the prices so that the cheapest ice cream bar comes first."
|
||||
|
Reference in New Issue
Block a user