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.

What is the minimum candies you must give?

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