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?

Arrays.fill (weight,1)  //都用1来填充

 

 

import java.util.*;
public class Solution {
public int candy(int[] ratings) {
int sum=0;
int[] count = new int[ratings.length];
if(ratings.length==0||ratings==null){
return 0;
}
else{
Arrays.fill(count,1);//每个人都拿到一个糖果
for(int i=1;i<ratings.length;i++){
if(ratings[i]>ratings[i-1]){
count[i]=count[i-1]+1;

}
}
for(int i=ratings.length-1;i>0;i--){
if(ratings[i]<ratings[i-1]&&count[i]>=count[i-1]){
count[i-1]=count[i]+1;
}
sum+=count[i];

}
sum+=count[0];
}

return sum;
}
}

转载于:https://www.cnblogs.com/Syiren/p/8982721.html