您当前位置：首页 > 互联网 > Leetcode 动态规划 Candy

Leetcode 动态规划 Candy

来源：程序员人生发布时间：2014-09-27 04:34:53 阅读次数：3476次

本文为senlie原创，转载请保留此地址：http://blog.csdn.net/zhengsenlie

Candy

Total Accepted: 16494 Total Submissions: 87468My Submissions

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?

题意：n 个小孩，每个小孩有一个评分。给小孩发糖。要求：
1)每个小孩至少一颗糖
2)评分高的小孩发的糖比他旁边两个小孩的多
思路：左右 dp
用一个数组 candy[n]，表示第 i 个小孩所应该发的最少糖果数
数组 ratings[n] 表示每个小孩的评分
1.从左到右扫描一遍， candy[i] = 1, if ratings[i] <= ratings[i-1] ; candy[i] = candy[i-1] + 1, if ratings[i] > ratings[i-1]
2.从右到左扫描一遍， candy[i] = candy[i], if ratings[i] <= ratings[i+1] ; candy[i] = max(candy[i], candy[i+1] + 1), if ratings[i] > ratings[i+1]
3.accumulate(candy, candy + n, 0)

复杂度：时间 O(n)，空间 O(n)

int candy(vector<int> &ratings){ int n = ratings.size(); vector<int> candy(n, 1); for(int i = 1; i < n; ++i){ candy[i] = ratings[i] <= ratings[i - 1] ? 1 : candy[i - 1] + 1; } for(int i = n - 2; i > -1;--i){ candy[i] = ratings[i] <= ratings[i + 1] ? candy[i] : max(candy[i], candy[i + 1] + 1); } return accumulate(candy.begin(), candy.end(), 0); }

生活不易，码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠
程序员人生

------分隔线----------------------------

上一篇 技术栈的选择：从Groupon转向Node.js、淘宝去IOE谈起

下一篇 MySQL还是NoSQL：开源盛世下的数据库该如何选择

分享到:

------分隔线----------------------------

为码而活

积分：4237

15粉丝

7关注

栏目热点