Candy

最新推荐文章于 2024-09-19 21:28:03 发布

dutsoft

最新推荐文章于 2024-09-19 21:28:03 发布

阅读量569

点赞数

文章标签：算法数组

本文链接：https://blog.csdn.net/dutsoft/article/details/38736937

版权

LeetCode 专栏收录该内容

111 篇文章 0 订阅

订阅专栏

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==null || ratings.length==0) return 0;
        int n=ratings.length;
        int inc=1,res=n;
        int []candy=new int[n];
        for(int i=1;i<n;i++){
            if(ratings[i]>ratings[i-1]){
                candy[i]=Math.max(inc,candy[i]);
                inc++;
            }
            else{
                inc=1;
            }
        }
        inc=1;
        for(int i=n-2;i>=0;i--){
            if(ratings[i]>ratings[i+1]){
                candy[i]=Math.max(inc,candy[i]);
                inc++;
            }
            else{
                inc=1;
            }
        }
        for(int i=0;i<n;i++){
            res+=candy[i];
        }
        return res;
    }
}