分发糖果

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?

思路：之前考虑采用找到最小点，递归找到最小点两边的最小点...尝试后无果

先正向比较，得到糖数，再逆向比较，得到最终的糖数

int candy(vector<int> &ratings) {

　　int n=ratings.size();
　　vector<int> count(n,1);
　　for(int i=1;i<n;i++)
　　{
　　if(ratings[i]>ratings[i-1])
　　count[i]=count[i-1]+1;
　　}
　　for(int i=n-2;i>=0;i--)
　　{
　　if(ratings[i]>ratings[i+1] && count[i]<=count[i+1])
　　count[i]=count[i+1]+1;
　　}
　　int res=0;
　　for(int i=0;i<n;i++)
　　　　res+=count[i];
　　return res;
}