classSolution{publicintcandy(int[] ratings){int[] ans =newint[ratings.length];
ans[0]=1;for(int i =1; i < ratings.length; i++){if(ratings[i]> ratings[i -1]){
ans[i]= ans[i -1]+1;}else{
ans[i]=1;}}for(int i = ratings.length -2; i >=0; i--){if(ratings[i]> ratings[i +1]){
ans[i]=Math.max(ans[i], ans[i +1]+1);}}int sum =0;for(int x : ans){
sum += x;}return sum;}}classSolution{publicintcandy(int[] ratings){int[] candyVec =newint[ratings.length];
candyVec[0]=1;for(int i =1; i < ratings.length; i++){if(ratings[i]> ratings[i -1]){
candyVec[i]= candyVec[i -1]+1;}else{
candyVec[i]=1;}}for(int i = ratings.length -2; i >=0; i--){if(ratings[i]> ratings[i +1]){
candyVec[i]=Math.max(candyVec[i], candyVec[i +1]+1);}}int sum =0;for(int s : candyVec){
sum += s;}return sum;}}