135. Candy

最新推荐文章于 2024-01-03 14:27:00 发布

weixin_30920091

最新推荐文章于 2024-01-03 14:27:00 发布

阅读量37

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/joannacode/p/5958892.html

本文介绍了一个经典的算法问题——糖果分配问题。该问题要求在满足特定条件的情况下，为每个孩子分配最少数量的糖果。文章提供了一段Java代码实现，通过两次遍历数组的方法解决了这一问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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) {
        if(ratings.length == 0){
            return 0;
        }
        if(ratings.length == 1){
            return 1;
        }
        int sum = 0;
        int candy[] = new int[ratings.length];
        Arrays.fill(candy, 1);
        for(int i = 1; i < ratings.length; i++){
            if(ratings[i] > ratings[i - 1])
                candy[i] = candy[i-1]+1;
        }
        for(int i = ratings.length - 1; i > 0; i--){
            if(ratings[i-1] > ratings[i])
                candy[i-1] = Math.max(candy[i] + 1,candy[i-1]);
        }
        for(int i = 0; i < candy.length ; i ++){
            sum += candy[i];
        }
        return sum;
    }
}