lintcode:Candy

最新推荐文章于 2020-10-13 00:08:17 发布

martin_liang

最新推荐文章于 2020-10-13 00:08:17 发布

阅读量361

点赞数

分类专栏： C++/C 算法 lintcode

本文链接：https://blog.csdn.net/martin_liang/article/details/50738148

版权

算法同时被 3 个专栏收录

537 篇文章 1 订阅

订阅专栏

C++/C

504 篇文章 0 订阅

订阅专栏

lintcode

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

Have you met this question in a real interview?

Example

Given ratings = [1, 2], return 3.

Given ratings = [1, 1, 1], return 3.

Given ratings = [1, 2, 2], return 4. ([1,2,1]).

class Solution {
public:
    /**
     * @param ratings Children's ratings
     * @return the minimum candies you must give
     */
     
    // input as [2,6,5,4]
    int candy(vector<int>& ratings) {
        // Write your code here
        
        if (ratings.size() == 0)
            return 0;
            
        // need to initialize as 1, very important
        vector<int> auxVtr(ratings.size(), 1); 
        
        for (int i=1; i<ratings.size(); i++)
        {
            if (ratings[i] > ratings[i-1])
                auxVtr[i] = auxVtr[i-1]+1;
        }
        //这种算法只计算当前值和上一个值比较,如果比上一个值大，需要加一，但是没有考虑当前值比前一个值小的情况，就是说无论从左到右还是从右到左，都知道看上升，看不见下降，下降需要由另外一个方向计算
        for (int i=ratings.size()-2; i>=0; i--)
        {
            if ((ratings[i] > ratings[i+1]) && (auxVtr[i] <= auxVtr[i+1])) // 1234567623 左到右1234567112，右到左  1234567211
                auxVtr[i] = auxVtr[i+1]+1;
        }
        
        int sum = 0;
        for (int i=0; i<ratings.size(); i++)
            sum += auxVtr[i];
            
        return sum;
    }
};