[LeetCode]Candy

最新推荐文章于 2018-06-24 04:59:47 发布

原创最新推荐文章于 2018-06-24 04:59:47 发布 · 708 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

LeetCode 专栏收录该内容

102 篇文章

订阅专栏

解决一个有趣的问题：如何确保每个孩子得到的糖果数量与其等级值相匹配，同时满足基本规则：每个孩子至少得到一个糖果，且等级高的孩子比邻居得到更多糖果。

题目描述

There are N children standing in a line. Each child is assigned a rating value.

You are giving candies to these children subjected to the following requirements:

Each child must have at least one candy.
Children with a higher rating get more candies than their neighbors.

有n个小孩站成一条直线，每个小孩被分配一个等级值，你需要给这些小孩分配糖果，满足以下要求：

每一个小孩至少一个糖果；
等级值高的小孩要比等级值低小孩分配的糖果多；

解题思路

思路很简单，首先给所有小孩分配一个糖果，满足条件一；其次，顺序扫描一遍，找到顺序的递增数列，分配糖果；第三逆序扫描一遍，找到逆序的递增数列，分配糖果，满足条件二。over！

代码

/**
	 * There are N children standing in a line. Each child is assigned a rating value.
	 * You are giving candies to these children subjected to the following requirements:
	 * Each child must have at least one candy.
	 * Children with a higher rating get more candies than their neighbors.
	 * @param ratings
	 * @return
	 */
	public static int candy(int[] ratings) {
		int length = ratings.length;
		int[] candies = new int[length];
		int result = 0;

		Arrays.fill(candies, 1);

		//顺序扫一遍，找出递增序列并加糖果
		for (int i = 1; i < length; i++) {
			if (ratings[i] > ratings[i - 1]) {
				candies[i] = candies[i - 1] + 1;
			}
		}

		result += candies[length - 1];
		
		//逆序扫一遍，找出递增序列并加糖果
		for (int i = length - 2; i >= 0; i--) {
			if (ratings[i] > ratings[i + 1] && candies[i] <= candies[i + 1]) {
				candies[i] = candies[i + 1] + 1;
			}
			result += candies[i];
		}
		return result;
	}