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-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions

View File

@@ -11,8 +11,8 @@
"translatedContent": null,
"isPaidOnly": false,
"difficulty": "Medium",
"likes": 836,
"dislikes": 103,
"likes": 875,
"dislikes": 110,
"isLiked": null,
"similarQuestions": "[{\"title\": \"Parallel Courses III\", \"titleSlug\": \"parallel-courses-iii\", \"difficulty\": \"Hard\", \"translatedTitle\": null}]",
"exampleTestcases": "[[1,2],[2,4],[3,2],[4,1]]\n[[7,10],[7,12],[7,5],[7,4],[7,2]]",
@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"32.3K\", \"totalSubmission\": \"79.2K\", \"totalAcceptedRaw\": 32252, \"totalSubmissionRaw\": 79216, \"acRate\": \"40.7%\"}",
"stats": "{\"totalAccepted\": \"34.3K\", \"totalSubmission\": \"83.6K\", \"totalAcceptedRaw\": 34257, \"totalSubmissionRaw\": 83571, \"acRate\": \"41.0%\"}",
"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"