Leetcode 智力trick题

proudmore

于 2015-03-04 06:54:14 发布

阅读量120

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/proudmore/article/details/44055195

本文介绍了一种高效的算法，用于解决给一群孩子分配糖果的问题，确保每个孩子至少得到一个糖果，并且评分高的孩子比邻居得到更多糖果。该算法通过双向遍历实现了最小糖果数目的分配。

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

candy

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