135.分发糖果.java

import java.util.Arrays;

/*
 * @lc app=leetcode.cn id=135 lang=java
 *
 * [135] 分发糖果
 */

// @lc code=start
class Solution {
    public int candy(int[] ratings) {
        int[] left = new int[ratings.length];
        int[] right = new int[ratings.length];
        Arrays.fill(left, 1);
        Arrays.fill(right, 1);
        for(int i = 1;i < ratings.length;i++){
            if(ratings[i] > ratings[i - 1]){
                 left[i] = left[i - 1] + 1;
            }
        }
        int count = left[left.length - 1];
        for(int i = ratings.length - 2;i >= 0;i--){
            if(ratings[i] > ratings[i + 1]){
                right[i] = right[i + 1] + 1;
            }
            count += Math.max(right[i], left[i]);
        }
        return count;
    }
}
// @lc code=end