zoukankan      html  css  js  c++  java
  • Queue-621. Task Scheduler

    Given a char array representing tasks CPU need to do. It contains capital letters A to Z where different letters represent different tasks.Tasks could be done without original order. Each task could be done in one interval. For each interval, CPU could finish one task or just be idle.

    However, there is a non-negative cooling interval n that means between two same tasks, there must be at least n intervals that CPU are doing different tasks or just be idle. 

    You need to return the least number of intervals the CPU will take to finish all the given tasks.

    Example 1:

    Input: tasks = ["A","A","A","B","B","B"], n = 2
    Output: 8
    Explanation: A -> B -> idle -> A -> B -> idle -> A -> B.
    

    Note:

    1. The number of tasks is in the range [1, 10000].
    2. The integer n is in the range [0, 100].
    class Solution {
    public:
        int leastInterval(vector<char>& tasks, int n) {
            vector<int> cnt(26, 0);
            for (char task : tasks) {
                ++cnt[task - 'A'];
            }
            sort(cnt.begin(), cnt.end());
            int i = 25, mx = cnt[25], len = tasks.size();
            while (i >= 0 && cnt[i] == mx) --i;
            return max(len, (mx - 1) * (n + 1) + 25 - i);
        }
    };
  • 相关阅读:
    iOS_核心动画(二)
    iOS_核心动画CALayer(一)
    iOS_KVC与KVO
    iOS_Quartz 2D绘图
    iOS_触摸事件与手势识别
    iOS_多线程(二)
    iOS_多线程(一)
    iOS_UIAlertController
    CTF-Pwn-[BJDCTF 2nd]diff
    数据结构--队列(Java实现)
  • 原文地址:https://www.cnblogs.com/msymm/p/8278252.html
Copyright © 2011-2022 走看看