首页 > 代码库 > 135. Candy
135. 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) { if(ratings.length == 0){ return 0; } if(ratings.length == 1){ return 1; } int sum = 0; int candy[] = new int[ratings.length]; Arrays.fill(candy, 1); for(int i = 1; i < ratings.length; i++){ if(ratings[i] > ratings[i - 1]) candy[i] = candy[i-1]+1; } for(int i = ratings.length - 1; i > 0; i--){ if(ratings[i-1] > ratings[i]) candy[i-1] = Math.max(candy[i] + 1,candy[i-1]); } for(int i = 0; i < candy.length ; i ++){ sum += candy[i]; } return sum; }}
135. Candy
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。