leetcode/get_bonuses.cpp at master · Mayank-Parasar/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
//
// Created by Mayank Parasar on 2020-01-21.
//

/*
 * 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]

 */

#include <iostream>
#include <vector>

using namespace std;

vector<int> get_bonuses(const vector<int>& inp) {

    vector<int> bonuses(inp.size(), 1); // everyone gets '1' as the bonus

    /*for(auto i : bonuses)
        cout << i << " ";*/

    for(int ii=0; ii < bonuses.size(); ii++) {

        if(ii == 0) { // then check only the next neighbor
            if(inp[ii] > inp[ii+1])
                bonuses[ii] += 1;
        }
        else if(ii == (bonuses.size() - 1)) {
            if(inp[ii] > inp[ii-1])
                bonuses[ii] += 1;
        }
        else {
            if(inp[ii] > inp[ii-1])
                bonuses[ii] += 1;

            if(inp[ii]> inp[ii+1])
                bonuses[ii] += 1;
        }

    }

    return(bonuses);
}

int main() {

    vector<int> inp = {1, 2, 3, 2, 3, 5, 1};

    for (auto i : inp)
        cout << i << " ";

    vector<int> bonus = get_bonuses(inp);
    cout << endl;
    for (auto i : bonus)
        cout << i << " ";

    return 0;
}