Leetcode 135 Candy

triplebee

发布于 2018-01-12 14:52:33

5090

发布于 2018-01-12 14:52:33

文章被收录于专栏：计算机视觉与深度学习基础

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?

分糖果，每个人至少一个，得分较左右高的人要比左右的人分的多。

先是想了DP，后来发现不需要，每个人初始分一个，然后找到单调上升和单调下降的区间，区间转折点取最大值。

程序实现的时候是正一遍，反一遍来的，实现起来比较方便。

class Solution {
public:
    int candy(vector<int>& ratings) {
        vector<int> dp(ratings.size(), 1);
        int res = 0;
        for(int i = 1; i < ratings.size();i++) if(ratings[i]>ratings[i-1]) dp[i] = dp[i-1] + 1;
        for(int i = ratings.size()-2;i >= 0 ;i--)
        {
            if(ratings[i] > ratings[i+1]) dp[i] = max(dp[i], dp[i+1] + 1) ;
            res += dp[i];
        }
        return res + dp[ratings.size()-1];
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2016-11-16 ，如有侵权请联系 cloudcommunity@tencent.com 删除

children