leetcode-621-Task Scheduler

最新推荐文章于 2022-02-12 21:44:21 发布

原创最新推荐文章于 2022-02-12 21:44:21 发布 · 134 阅读

0 ·

CC 4.0 BY-SA版权

算法专栏收录该内容

185 篇文章

订阅专栏

本文探讨了任务调度算法中关于最大字符出现频率的问题，提出了一种使用优先级队列的解决方案。通过存储每个字符出现的次数，将时间间隔视为时间槽，并尝试填充任务到这些槽中，最终计算出总的空闲时间加上任务大小。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Error:
do not know how to do: Actually I know part of answer, but do not think it thoroughly.

In here, we have two cases: mainly of max. char or not mainly of max. char.

ideally, the answer is idle + total of task

so it need to know how many idle in it. which we get (max. - 1) * n empty position and fill remain alpha in it, if idle >= 0 than output idle + task.size(), otherwise output task.size()

use priority_queue to do this:
1. store the times of each character occur.
2. treat each intervals as the time slots, try to fill the task into the slots.
3. accumulate the time