页面顶部 Top
文件:  root - text - article - 2020 - 02 - multitasking.txt
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 912 次阅读, 22035 次搜索 | 77 个单词

定阅此目录的博客 | 浏览 | 博客存档
Hi, here's your problem today. This problem was recently asked by AirBNB:

We have a list of tasks to perform, with a cooldown period. We can do multiple of these at the same time, but we cannot run the same task simultaneously.

Given a list of tasks, find how long it will take to complete the tasks in the order they are input.
tasks = [1, 1, 2, 1]
cooldown = 2
output: 7 (order is 1 _ _ 1 2 _ 1)
def findTime(arr, cooldown):
# Fill this in.

print findTime([1, 1, 2, 1], 2)
# 7
标签: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | 英文 | 主页 | 类别: 计算机科学 | 912 次阅读, 22035 次搜索 | 77 个单词 定阅此目录的博客

猜您喜欢...

  1. Daily Interview Problem: Queue Using Two Stacks
  2. Daily Interview Problem: Largest Product of 3 Elements I
  3. YES!!
  4. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  5. Daily Interview Problem: Sort Colors
  6. 56 Bytes
  7. Algorithm Interview: Maximum Path Sum in Binary Tree
  8. [Daily Problem] Move Zeros
  9. Maximum In A Stack
  10. Daily Interview Problem: 3 Sum

评论 (0)

    当前页暂时没有评论。


最后更新: October 30 2020 14:21:12 | RSS Subscription
牛排怎么做才好吃? | <meta name="机器人" content="不索引, 跟踪" />