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