Candy

两遍遍历，使得左右邻居都合法

public class Solution {
    public int candy(int[] ratings) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int[] candy = new int[ratings.length];
        int count = 0;
        candy[0] = 1;
        for(int i = 1; i < candy.length; i++)
        {
            if(ratings[i] > ratings[i-1])
                candy[i] = candy[i-1]+1;
            else
                candy[i] = 1;
        }
        for(int i = candy.length - 2; i>= 0; i--)
        {
            if(ratings[i] > ratings[i + 1])
                candy[i] = Math.max(candy[i], candy[i+1]+1);
        }
        for(int i = 0; i < candy.length; i++)
            count += candy[i];
        return count;
    }
}