/
Candy.cpp
26 lines (26 loc) · 967 Bytes
/
Candy.cpp
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
/*
There are N children standing in a line. Each child is assigned a rating value.
You are giving candies to these children subjected to the following requirements:
Each child must have at least one candy.
Children with a higher rating get more candies than their neighbors.
What is the minimum candies you must give?
*/
class Solution {
public:
int candy(vector<int>& ratings) {
vector<int> candy(ratings.size(), 1);
int result = 0;
for (int i = 1; i < ratings.size(); i++) {
if (ratings[i] > ratings[i - 1])candy[i] = candy[i - 1] + 1;
}
result += candy[ratings.size() - 1];
for (int i = ratings.size() - 2; i >= 0; i--) {
if (ratings[i] > ratings[i + 1] && candy[i] <= candy[i + 1]) candy[i] = candy[i + 1] + 1;
result += candy[i];
}
/* for(int i =0;i<ratings.size();i++){
* result += candy[i];
} */
return result;
}
};