Leetcode135：分发糖果

题目描述

思路分析

代码实现

package LeetCode;

import java.util.Arrays;

public class Candy {

	public static void main(String[] args) {

	}

	// 先从左至右遍历学生成绩 ratings，按照以下规则给糖，并记录在 left 中：
	public int candy(int[] ratings) {// ratings:评定等级
		int[] left = new int[ratings.length];
		int[] right = new int[ratings.length];
		Arrays.fill(left, 1);// 向数组中填充相同的值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[ratings.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(left[i], right[i]);
		}
		return count;
	}
}