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": "Hard",
|
||||
"likes": 222,
|
||||
"likes": 223,
|
||||
"dislikes": 12,
|
||||
"isLiked": null,
|
||||
"similarQuestions": "[{\"title\": \"Most Profit Assigning Work\", \"titleSlug\": \"most-profit-assigning-work\", \"difficulty\": \"Medium\", \"translatedTitle\": null}, {\"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\": \"4.2K\", \"totalSubmission\": \"11.6K\", \"totalAcceptedRaw\": 4249, \"totalSubmissionRaw\": 11553, \"acRate\": \"36.8%\"}",
|
||||
"stats": "{\"totalAccepted\": \"4.3K\", \"totalSubmission\": \"11.7K\", \"totalAcceptedRaw\": 4283, \"totalSubmissionRaw\": 11669, \"acRate\": \"36.7%\"}",
|
||||
"hints": [
|
||||
"Is it possible to assign the first k smallest tasks to the workers?",
|
||||
"How can you efficiently try every k?"
|
||||
|
Reference in New Issue
Block a user