本文探讨了如何根据孩子们的评分来分配最少数量的糖果，确保每个孩子至少得到一颗糖果，并且评分高的孩子比邻居得到更多糖果。文章最后给出了实现这一目标的算法思路。
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?
提示：提交代码后，需要用简洁的语言解释一下代码思路~ 谢谢
历史题目和总结见公众号「每日一道算法题」
https://leetcode.com/problems/candy/description/
思路：
扫一扫
1483
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
