-
Notifications
You must be signed in to change notification settings - Fork 2
/
candy.cpp
33 lines (27 loc) · 1004 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
27
28
29
30
31
32
33
题目描述
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?
时间复杂度O(n),空间复杂度O(n)
class Solution {
public:
int candy(vector<int> &ratings) {
const int n = ratings.size();
vector<int> increment(n);
for(int i = 1, inc = 1; i < n; i++){
if(ratings[i] > ratings[i-1])
increment[i] = max(inc++, increment[i]);
else
inc = 1;
}
for(int i = n-2, inc = 1; i >= 0; i--){
if(ratings[i] > ratings[i+1])
increment[i] = max(inc++, increment[i]);
else
inc = 1;
}
return accumulate(&increment[0], &increment[0]+n, n);
}
};