Candy.java

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