*leetcode #135 in cpp

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?

Solution:

http://www.cnblogs.com/higerzhang/p/4158787.html

Code:

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