File: root - text - article - 2019 - 12 - distribute-bonuses.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 550 Views, 16935 Search Bots | 144 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 550 Views, 16935 Search Bots | 144 Words
| Browse | Archive
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:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 550 Views, 16935 Search Bots | 144 Words 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]
Related Articles
- Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
- Staying on a Chess Board
- Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
- [Daily Problem] Longest Increasing Subsequence
- Daily Interview Problem: Contiguous Subarray with Maximum Sum
- First and Last Indices of an Element in a Sorted Array
- Daily Interview Problem:Create a balanced binary search tree
- Reverse a Directed Graph
- How to Play WAV music under DOS?
- Palindrome Integers
©2006~2024 SteakOverCooked - 0.01122 Seconds(s) - 4777.767 KB/s - 30 Online Memory: 528.9 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !