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

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

You are the manager of a number of employees who all sit in a row. The CEO would like to give bonuses to all of your employees, but since the company did not perform so well this year the CEO would like to keep the bonuses to a minimum.

The rules of giving bonuses is that:
- Each employee begins with a bonus factor of 1x.
- For each employee, if they perform better than the person sitting next to them, the employee is given +1 higher bonus (and up to +2 if they perform better than both people to their sides).

Given a list of employee's performance, find the bonuses each employee should get.

Example:
Input: [1, 2, 3, 2, 3, 5, 1]
Output: [1, 2, 3, 1, 2, 3, 1]
Here's your starting point:


def getBonuses(performance):
# Fill this in.

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

猜您喜欢...

  1. Daily Interview Problem: Product of Array Except Self
  2. Spreadsheet Columns
  3. Non-decreasing Array with Single Modification
  4. Two-Sum
  5. Daily Interview Problem: Buddy Strings
  6. Skip the readings, focus on problems. And use all the hints!
  7. Daily Interview Problem: Trapping Rainwater
  8. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  9. Daily Interview Problem: Maximum Profit From Stocks
  10. Algorithm Interview Question: Max and Min with Limited Comparisons

评论 (0)

    当前页暂时没有评论。


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