leetcode第16题（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?

思路：

代码：

importjava.util.Arrays;

public class Solution {
public int candy(int[] ratings) {
if(ratings == null || ratings.length == 0){
return 0;
}
int n = ratings.length;
int[] candy = new int
;
int sum=0;
Arrays.fill(candy,1);
for(int i=1;i<n;i++){
if(ratings[i]>ratings[i-1]){
candy[i] = candy[i-1]+1;
}
}
for(int i=n-1;i>=1;i--){
if(ratings[i-1]>ratings[i] && candy[i-1] <= candy[i]){
candy[i-1 ] = candy[i]+1;
}
}
for(int num:candy){
sum+=num;
}
return sum;
}
}