LeetCode:Candy

Candy

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?

<span style="font-size:18px;"> int candy(vector<int> &ratings) {
vector<int> result(ratings.size(),1);
for(int i = 1; i < ratings.size();i++)
{
if(ratings[i] > ratings[i-1])
result[i] = result[i-1] + 1;
}
for(int i = ratings.size()-2;i>=0;i--)
{
if(ratings[i]>ratings[i+1])
{
result[i] = result[i] >= result[i+1] + 1 ? result[i] : result[i+1] + 1;
}
}
int num = 0;
for(int i = 0; i < ratings.size();i++)
{
num+=result[i];
}
return num;
}</span>

分别从前向后、从后向前修正结果
已AC