要喝温的

LeetCode 刷题笔记 之 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.

解答如下:

其实是一个数学问题。最终需要最少的任务时间:(最多任务数-1)*(n + 1) + (相同最多任务的任务个数);

代码:

class Solution {
    public int leastInterval(char[] tasks, int n) {
        int[] c = new int[26];

        for (char t : tasks){
            c[t - 'A']++;
        }
        Arrays.sort(c);

        int i = 25;
        while (i >= 0 && c[i] == c[25]) i--;

        return Math.max(tasks.length, (c[25]-1) * (n+1) + (25-i));
    }
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/u013065237/article/details/80317274
个人分类: Java
想对作者说点什么? 我来说一句

算法刷题LeetCode

2018年01月08日 837KB 下载

没有更多推荐了,返回首页

不良信息举报

LeetCode 刷题笔记 之 Task Scheduler

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭