mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-05 15:31:43 +08:00
update
This commit is contained in:
@@ -155,7 +155,7 @@
|
||||
"__typename": "CodeSnippetNode"
|
||||
}
|
||||
],
|
||||
"stats": "{\"totalAccepted\": \"96.7K\", \"totalSubmission\": \"212.2K\", \"totalAcceptedRaw\": 96741, \"totalSubmissionRaw\": 212241, \"acRate\": \"45.6%\"}",
|
||||
"stats": "{\"totalAccepted\": \"96.8K\", \"totalSubmission\": \"212.3K\", \"totalAcceptedRaw\": 96754, \"totalSubmissionRaw\": 212265, \"acRate\": \"45.6%\"}",
|
||||
"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