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?

package leetCode;
import java.util.Arrays;
/**
 * Created by lxw, [email protected] on 2018/3/27.
 */
public class L135_Candy {

    /*從左到右遍歷一次，再從右到左遍歷一次，具體地，    * 從左到右遍歷，使得右邊評分更高的元素比左邊至少多於1個糖果    * 從右到左遍歷，使得左邊評分更高的元素比右邊至少多於1個糖果    * */
public int candy(int[] ratings){
        int[] candies = new int[ratings.length
 
];
Arrays.fill(candies, 1);
        for (int i = 1; i < candies.length; i++){
            if (ratings[i] > ratings[i-1]){
                candies[i] = candies[i-1] + 1;
}
        }

        for (int i = candies.length-2; i >= 0; i--){
            if (ratings[i] > ratings[i+1]){
                candies[i] = Math.max
 
(candies[i],candies[i+1] +1);
}
        }

        int sum = 0;
        for (int candy : candies){
            sum += candy;
}
        return sum;
}

    
}