【leetcode】135. Candy【java】
来源:互联网 发布:windows 资源监控数据 编辑:程序博客网 时间:2024/04/29 15:07
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[] candies = new int[ratings.length]; Arrays.fill(candies, 1);//每人先发一个糖果 for (int i = 1; i < ratings.length; i++) { if (ratings[i] > ratings[i - 1]) { candies[i] = candies[i - 1] + 1;//从左向右遍历,确保相邻的两个孩子,如果右侧孩子比左侧孩子评分高,则右侧孩子的比左侧的孩子手中的果多一个 } } for (int i = ratings.length - 2; i >= 0; i--) { if (ratings[i] > ratings[i + 1]) { candies[i] = Math.max(candies[i], candies[i + 1] + 1);//从右向左遍历,确保相邻的两个孩子,如果左侧孩子比右侧孩子评分高,则左侧孩子应该 //保证比右侧评分低的孩子多一个糖果。 } } int sum = 0; for (int candy : candies) { sum += candy; } return sum; } }
0 0
- 【leetcode】135. Candy【java】
- [LeetCode] 135. Candy java
- LeetCode-135. Candy (JAVA)根据等级分糖果
- [Leetcode] Candy (Java)
- [leetcode] Candy Java
- [LeetCode][Java] Candy
- [leetcode-135]Candy(java)
- leetcode:Candy 【Java】
- [LeetCode]135.Candy
- 135. Candy Leetcode Python
- [Leetcode] 135. Candy
- [leetcode] 135.Candy
- [leetcode] 135. Candy
- leetcode 135. Candy
- leetcode 135. Candy
- [LeetCode]135. Candy
- LeetCode 135. Candy
- Leetcode 135. Candy
- js验证
- JavaScript引用方式
- python--两个牛逼的BIF,内置函数
- derby分页查询
- fadeOut、fadeIn
- 【leetcode】135. Candy【java】
- Linux内核驱动之GPIO子系统(一)GPIO的使用
- ZCMU-1178-完美的数
- mysql进程SHOW PROCESSLIST详解Command命令状态
- Java注释@interface的用法
- 网络爬虫:利用有道实现“语言翻译”功能
- Qt中的delete和new
- Qt 5.6.2 静态编译(VS2013 x86 target xp openssl icu webkit)
- 用CSS除去UL标签小圆点