N个孩子站一行分糖

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?

import java.util.*;
public class Solution {
    public int candy(int[] ratings) {
        int []count =new int[ratings.length];
        Arrays.fill(count,1);
        int sum=0;
        for(int i=1;i<count.length;i++){
            if(ratings[i]>ratings[i-1]){
                count[i]=count[i-1]+1;
            }
        }  
        sum+=count[count.length-1];
        for(int i=count.length-2;i>=0;i--){
            if((ratings[i]>ratings[i+1])&&count[i]<=count[i+1]){
                count[i]=count[i+1]+1;
            }
            sum+=count[i];
        }
        return sum;
    }
}