1
0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee
This commit is contained in:
2022-03-29 15:21:05 +08:00
parent b84ae535b7
commit e730aa6794
2244 changed files with 8703 additions and 59499 deletions

View File

@@ -11,7 +11,7 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 833,
"likes": 836,
"dislikes": 103,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Parallel Courses III\", \"titleSlug\": \"parallel-courses-iii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"32.1K\", \"totalSubmission\": \"78.9K\", \"totalAcceptedRaw\": 32100, \"totalSubmissionRaw\": 78898, \"acRate\": \"40.7%\"}",
"stats": "{\"totalAccepted\": \"32.3K\", \"totalSubmission\": \"79.2K\", \"totalAcceptedRaw\": 32252, \"totalSubmissionRaw\": 79216, \"acRate\": \"40.7%\"}",
"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"