mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-06 07:51:41 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"10.9K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 10948, \"totalSubmissionRaw\": 28669, \"acRate\": \"38.2%\"}",
|
||||
"stats": "{\"totalAccepted\": \"11K\", \"totalSubmission\": \"28.7K\", \"totalAcceptedRaw\": 10952, \"totalSubmissionRaw\": 28673, \"acRate\": \"38.2%\"}",
|
||||
"hints": [
|
||||
"To simulate the problem we first need to note that if at any point in time there are no enqueued tasks we need to wait to the smallest enqueue time of a non-processed element",
|
||||
"We need a data structure like a min-heap to support choosing the task with the smallest processing time from all the enqueued tasks"
|
||||
|
Reference in New Issue
Block a user