mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-02 22:13:28 +08:00
update
This commit is contained in:
@@ -149,7 +149,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"20.1K\", \"totalAcceptedRaw\": 7201, \"totalSubmissionRaw\": 20052, \"acRate\": \"35.9%\"}",
|
||||
"stats": "{\"totalAccepted\": \"7.2K\", \"totalSubmission\": \"20.1K\", \"totalAcceptedRaw\": 7212, \"totalSubmissionRaw\": 20084, \"acRate\": \"35.9%\"}",
|
||||
"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