Candy
来源:互联网 发布:js obj 获取value 编辑:程序博客网 时间:2024/04/30 10:56
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[] candy = new int[ratings.length]; candy[0] = 1; for (int i = 1; i < ratings.length; i++) { candy[i] = ratings[i] > ratings[i - 1] ? candy[i - 1] + 1 : 1; } int totalCandy = candy[ratings.length - 1]; for (int i = ratings.length - 2; i >= 0; i--) { candy[i] = (ratings[i] > ratings[i + 1] && candy[i + 1] + 1 > candy[i]) ? candy[i + 1] + 1 : candy[i]; totalCandy += candy[i]; } return totalCandy; }}
0 0
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- Candy
- candy
- Candy
- Candy
- Candy
- Candy
- 从客户端中检测到有潜在危险的 Request.Form 值的详细解决方法
- .net MVC 表单提交
- [leet code] Best Time to Buy and Sell Stock
- 快速排序、三路快排、双基准
- 序列化
- Candy
- iTunes Connect程序被拒,如何申诉?
- Excel中强大的数据导入功能
- 硬件工程师的软件之路—— ARM板卡的调试流程
- Linux 获取CPU温度
- js获取光标位置和设置文本框光标位置
- python抓取京东价格分析京东商品价格走势
- [LeetCode] Clone Graph
- PHP中设置时区方法小结