LeetCode: 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?

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])
{
candy[i] = candy[i-1] + 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;
}
}
for(int i = 0; i < candy.size(); i++)
result += candy[i];
return result;
}
};

Round 2:

class Solution {
public:
int candy(vector<int>& ratings) {
vector<int> candies(ratings.size(), 1);
int result = 0;
for(int i = 1; i < ratings.size(); i++){
if(ratings[i] > ratings[i-1] && candies[i] <= candies[i-1]){
candies[i] = candies[i-1] + 1;
}
}
for(int i = ratings.size()-2; i >= 0; i--){
if(ratings[i] > ratings[i+1] && candies[i] <= candies[i+1]){
candies[i] = candies[i+1] + 1;
}
result += candies[i];
}
result += candies[ratings.size()-1];
return result;
}
};