LeetCode:Candy

最新推荐文章于 2019-07-27 09:58:00 发布

walker lee

最新推荐文章于 2019-07-27 09:58:00 发布

阅读量3.6k

点赞数

分类专栏： LeetCode OJ LeetCode解题记录文章标签： LeetCode Candy

本文链接：https://blog.youkuaiyun.com/itismelzp/article/details/51502655

版权

LeetCode OJ 同时被 2 个专栏收录

216 篇文章

订阅专栏

LeetCode解题记录

216 篇文章

订阅专栏

解决一个特定问题：如何在确保高评分的孩子比邻居获得更多糖果的前提下，给孩子们分配最少数量的糖果。

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

Candy

Total Accepted: 52308 Total Submissions: 231427 Difficulty: Hard

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?

Subscribe to see which companies asked this question

Hide Tags

Greedy

思路：

1.先给每个小孩分1 个candy；

2.从左往右：如果，左<右，则右边小孩加1颗candy；

3.从右往左：如果，左>右，则左边小孩要比右边的candy多。

java code:

public class Solution {
    public int candy(int[] ratings) {
        
        int len = ratings.length;
        int[] candies = new int[len];
        for(int i=0;i<len;i++) candies[i] = 1;
        
        for(int i=1;i<len;i++) {
            if(ratings[i-1] < ratings[i])
                candies[i] = candies[i-1] + 1;
        }
        
        for(int i=len-1;i>0;i--) {
            if(ratings[i-1] > ratings[i])
                candies[i-1] = Math.max(candies[i-1], candies[i]+1);
        }
        
        int ans = 0;
        for(int candy : candies) {
            ans += candy;
        }
        
        return ans;
    }
}