LeetCode-candy

最新推荐文章于 2019-10-23 11:09:46 发布

原创最新推荐文章于 2019-10-23 11:09:46 发布 · 352 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#candy #LeetCode

LeetCode 专栏收录该内容

105 篇文章

订阅专栏

本文介绍了一种糖果分配算法，旨在确保每位儿童至少获得一颗糖果，并且评分较高的儿童比邻居获得更多的糖果。通过双向遍历和动态调整策略，实现了糖果的公平分配。

摘要生成于 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?

import java.util.*;
public class Solution {
    public int candy(int[] ratings) {
        int n = ratings.length;
        if(n==0 || ratings == null)
            return 0;
        int[] count = new int[n];
        int sum=0;
        //初始，每个孩子至少有一颗糖
        Arrays.fill(count, 1); 
        for(int i=1; i<n; i++){
            if(ratings[i] > ratings[i-1]){
                count[i] = count[i-1]+1;
            }
        }
        for(int i=n-1; i>0; i--){
            if(ratings[i]<ratings[i-1] && count[i]>=count[i-1]){
                count[i-1] = count[i]+1;
            }
            sum += count[i];
        }
        sum += count[0];
        return sum;
         
    }  
}