LeetCode OJ：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?

一个抠门的人要给一群孩子发糖果，在保证在相邻的孩子之间的rating较高者应该比rating低的获得更多的糖果的情况下，怎样发最少的糖果。

左右各遍历一次即可，代码如下所示：

 class Solution {
 public:
     int candy(vector<int>& ratings) {
         int sz = ratings.size();
         vector<int>candy(sz, );
         if(sz == ) return ;
         if(sz == ) return ;
         candy[] = ;
         for(int i = ; i < sz; ++i){
             if(ratings[i] > ratings[i-])
                 candy[i] = candy[i-] + ;
             else
                 candy[i] = ;
         }
         for(int i = sz-; i >= ; i--){
             if(ratings[i] > ratings[i+])
                 if(candy[i] <= candy[i+])
                     candy[i] = candy[i+] + ;
         }
         int sum = accumulate(candy.begin(), candy.end(), );
         return sum;
     }
 };