mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 07:21:40 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Medium",
|
||||
"likes": 698,
|
||||
"likes": 699,
|
||||
"dislikes": 263,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Maximum Running Time of N Computers\", \"titleSlug\": \"maximum-running-time-of-n-computers\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
@@ -167,7 +167,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"27K\", \"totalSubmission\": \"87.9K\", \"totalAcceptedRaw\": 27007, \"totalSubmissionRaw\": 87917, \"acRate\": \"30.7%\"}",
|
||||
"stats": "{\"totalAccepted\": \"27.1K\", \"totalSubmission\": \"88.3K\", \"totalAcceptedRaw\": 27113, \"totalSubmissionRaw\": 88312, \"acRate\": \"30.7%\"}",
|
||||
"hints": [
|
||||
"Greedily sell the most expensive ball.",
|
||||
"There is some value k where all balls of value > k are sold, and some, (maybe 0) of balls of value k are sold.",
|
||||
|
Reference in New Issue
Block a user