【Leetcode】Candy-优快云博客

本文介绍了一种算法解决方案，用于解决给定一系列孩子评分后，如何最少地分配糖果以确保评分高的孩子比邻居得到更多糖果的问题。通过两次遍历数组，先从左到右确保递增的评分获得递增的糖果数，再从右到左调整局部下降的评分糖果数，最终求得最小糖果总数。

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

Java:

http://blog.youkuaiyun.com/linhuanmars/article/details/21424783

CodeGanker的解法好简练最后没看懂..

public class Solution {
    public int candy(int[] ratings) {
        if(ratings.length==0||ratings==null) return 0;
        int[] nums=new int[ratings.length];
        nums[0]=1;
        
        for(int i=1;i<ratings.length;i++)
        {
            if(ratings[i]>ratings[i-1])
            {
                nums[i]=nums[i-1]+1;
            }
            else{
                nums[i]=1;
            }
        }
        int res=nums[ratings.length-1];
        for(int i=ratings.length-2;i>=0;i--)
        {
            int cur=1;
            if(ratings[i]>ratings[i+1])
            {
                cur=nums[i+1]+1;
            }
            res=res+Math.max(nums[i],cur);//confused,why they want max here
            nums[i]=cur;
        }
        
    return res;  
    }
}

这个解法更清晰：

http://rleetcode.blogspot.com/2014/01/candy-java.html

public class Solution {
    public int candy(int[] ratings) {
        if(ratings.length==0||ratings==null) return 0;
        int[] nums=new int[ratings.length];
        for(int i=0;i<nums.length;i++)
        {
            nums[i]=1;
        }
        for(int i=1;i<ratings.length;i++)
        {
            if(ratings[i]>ratings[i-1])
            {
                nums[i]=nums[i-1]+1;
            }
            
        }
        //int res=nums[ratings.length-1];
        for(int i=ratings.length-2;i>=0;i--)
        {
            int cur=1;
            if(ratings[i]>ratings[i+1]&&nums[i]<=nums[i+1])
            {
                nums[i]=nums[i+1]+1;
            }
        
        }
        int total=0;
        for(int i=0;i<nums.length;i++)
        {
            total+=nums[i];
        }
        
    return total;  
    }
}