117_leetcode_Candy

最新推荐文章于 2024-09-27 15:30:00 发布

ezzffzz

最新推荐文章于 2024-09-27 15:30:00 发布

阅读量338

点赞数

分类专栏： leetcode 算法编程文章标签： leetcode 算法编程语言面试

本文链接：https://blog.csdn.net/ezzffzz/article/details/34412551

版权

leetcode 同时被 3 个专栏收录

155 篇文章 0 订阅

订阅专栏

算法

155 篇文章 0 订阅

订阅专栏

编程

155 篇文章 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?

1:特殊情况；2:从前到后扫描数组，根据前后相邻rating值来确定饼干的数量；3:从后到前扫描数组，根据后前之间的关心调整饼干的数量；4:注意边界点；4:最后统计所有饼干数量

        int candy(vector<int> &ratings)
    {
        int size = (int)ratings.size();
        if(size <= 1)
        {
            return size;
        }
        
        vector<int> result(size, 0);
        result[0] = 1;
        
        //从左到右扫描数组
        for(int i = 1; i < size; i++)
        {
            if(ratings[i] > ratings[i-1])
            {
                result[i] = result[i-1] + 1;
            }
            else
            {
                result[i] = 1;
            }
        }
        
        //从右到左扫描数组
        for(int i = size - 2; i >= 0; i--)
        {
            if(ratings[i] > ratings[i+1])
            {
                result[i] = (result[i] > 1 + result[i+1] ? result[i] : 1 + result[i+1]);
            }
        }
        
        int maxValue = 0;
        for(int i = 0; i < size; i++)
        {
            maxValue += result[i];
        }

        return maxValue;
    }