Lintcode 945. Task Scheduler (Medium) (Python)

Task Scheduler

Description:

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

Given tasks = [‘A’,’A’,’A’,’B’,’B’,’B’], n = 2, return 8.

Explanation:
A -> B -> idle -> A -> B -> idle -> A -> B.

Notice

The number of tasks is in the range [1, 10000].
The integer n is in the range [0, 100].

Code:

1.

class Solution:
    """
    @param tasks: the given char array representing tasks CPU need to do
    @param n: the non-negative cooling interval
    @return: the least number of intervals the CPU will take to finish all the given tasks
    """
    def leastInterval(self, tasks, n):
        # write your code here
        cnt=collections.Counter(tasks)
        vmax = max(cnt.values())
        count = 0
        for i in cnt:
            if cnt[i]==vmax:
                count+=1
        return max(len(tasks), (vmax-1)*(n+1)+count)

2.

class Solution:
    """
    @param tasks: the given char array representing tasks CPU need to do
    @param n: the non-negative cooling interval
    @return: the least number of intervals the CPU will take to finish all the given tasks
    """
    def leastInterval(self, tasks, n):
        # write your code here
        cnt = collections.Counter(tasks)
        vmax = max(cnt.values())
        slots = (vmax - 1) * n
        return max(len(tasks), len(tasks)+slots+vmax-1-sum(n-(n==vmax) for n in cnt.values()))
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值