[LeetCode] Candy

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.

What is the minimum candies you must give?

LeetCode: https://oj.leetcode.com/problems/candy/

题解：本题分配糖果要求高优先级的小孩被分配的糖果要比他的相邻两个邻居多，我们可以分别从两个方向来考虑，首先通过从左向右遍历满足高优先级的小孩比他的左邻居分配的糖果多，然后通过从右向左遍历要求高优先级的小孩比他的右邻居分配的糖果多。

代码如下：

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