mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -11,7 +11,7 @@
|
||||
"translatedContent": null,
|
||||
"isPaidOnly": false,
|
||||
"difficulty": "Hard",
|
||||
"likes": 3007,
|
||||
"likes": 3008,
|
||||
"dislikes": 83,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Maximum Fruits Harvested After at Most K Steps\", \"titleSlug\": \"maximum-fruits-harvested-after-at-most-k-steps\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
|
||||
@@ -161,7 +161,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"91K\", \"totalSubmission\": \"189.6K\", \"totalAcceptedRaw\": 90959, \"totalSubmissionRaw\": 189583, \"acRate\": \"48.0%\"}",
|
||||
"stats": "{\"totalAccepted\": \"91K\", \"totalSubmission\": \"189.6K\", \"totalAcceptedRaw\": 90963, \"totalSubmissionRaw\": 189604, \"acRate\": \"48.0%\"}",
|
||||
"hints": [
|
||||
"Keep track of the engineers by their efficiency in decreasing order.",
|
||||
"Starting from one engineer, to build a team, it suffices to bring K-1 more engineers who have higher efficiencies as well as high speeds."
|
||||
|
Reference in New Issue
Block a user