[Leetcode] 135. Candy

最新推荐文章于 2024-08-24 19:27:15 发布

MatthrewX

最新推荐文章于 2024-08-24 19:27:15 发布

阅读量472

点赞数

CC 4.0 BY-SA版权

分类专栏： Leetcode 文章标签： Leetcode Dynamic Programming

本文链接：https://blog.youkuaiyun.com/u013897903/article/details/45000411

Leetcode 专栏收录该内容

143 篇文章

订阅专栏

本文介绍了一种高效的算法，用于解决给定一系列孩子评分后如何最小化分配糖果数量的问题。该算法确保每个孩子至少得到一个糖果，并且评分高的孩子比邻居得到更多糖果。

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 == null || ratings.length == 0) return 0;
        int[] dp = new int[ratings.length];
        dp[0] = 1;
        for(int i = 1; i < dp.length; i++){
            dp[i] = ratings[i] > ratings[i - 1]? dp[i - 1] + 1: 1;
        }
        int result = dp[dp.length - 1];
        for(int i = dp.length - 2; i >= 0; i--){
            if(ratings[i] > ratings[i + 1] && dp[i] <= dp[i + 1]){
                dp[i] = dp[i + 1] + 1;
            }
            result += dp[i];
        }
        return result;
    }
}