class Solution {
public int candy(int[] ratings) {
int [] left = new int [ratings.length];
Arrays.fill(left,1);
for(int i = 1 ; i < ratings.length ; i++){
if(ratings[i] > ratings[i-1]){
left[i] = left[i-1] + 1;
}
}
int right = left[left.length - 1];
for(int i = ratings.length - 1 ; i > 0 ; i--){
if(ratings[i - 1] > ratings[i]){
left[i - 1] = Math.max(left[i] + 1,left[i - 1]);
}
right += left[i - 1];
}
return right;
}
}