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.

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