Day_40.java

// 
class Solution {
    public int candy(int[] ratings) {
        int n = ratings.length;
        if(n == 0) return 0;
        int i = 1,sum=1;
        while(i<n){
            if(ratings[i] == ratings[i-1]){
                sum++;
                i++;
                continue;
            }
            int peak = 1;
            while(i<n && ratings[i] > ratings[i-1]){
                peak++;
                sum+=peak;
                i++;
            }
            int down = 1;
            while(i<n && ratings[i] < ratings[i-1]){
                sum+=down;
                down++;
                i++;
            }
            if(down>peak) sum += (down-peak);
        }
        return sum;
    }
}