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