[Leetcode] Candy (Java)

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?

发糖果

从两边各遍历一遍

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