本文共 1122 字，大约阅读时间需要 3 分钟。

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?

public class Solution {    public int candy(int[] ratings) {        int[] candies = new int[ratings.length];        Arrays.fill(candies, 1);//每人先发一个糖果        for (int i = 1; i < ratings.length; i++) {            if (ratings[i] > ratings[i - 1]) {                candies[i] = candies[i - 1] + 1;//从左向右遍历，确保相邻的两个孩子，如果右侧孩子比左侧孩子评分高，则右侧孩子的比左侧的孩子手中的果多一个            }        }        for (int i = ratings.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;    } }

转载地址：http://cxqrb.baihongyu.com/