LeetCode(135)Candy
来源:互联网 发布:高中背英语单词软件 编辑:程序博客网 时间:2024/05/29 19:16
题目:
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?
分析:贪心。首先每个孩子至少一颗糖果,所以每个孩子先给一颗。然后从前往后遍历,如果第i+1个孩子的等级要大于第i个孩子的等级,那么第i+1个孩子的糖果数至少比第i个孩子糖果数多1,所以我们先让第i+1个孩子的糖果数为第i个孩子的糖果数加1。这样解决了前一个孩子等级比后一个孩子等级高的问题,但是还有可能后一个孩子比前一个孩子等级高。所以我们再从后往前遍历,假如第i-1个孩子的等级比第i个孩子等级高,但是糖果数更少,就让第i-1个孩子的糖果数等于第i个孩子的糖果数加1。
复杂度:O(n)
代码:
class Solution {public: int candy(vector<int>& ratings) { int n=ratings.size(); int sum=0; vector<int> num(n,1); for(int i=0;i<n-1;i++)//从前往后遍历 { if(ratings[i+1]>ratings[i]) num[i+1]=num[i]+1; } for(int i=n-1;i>0;i--)//从后往前遍历 { if(ratings[i-1]>ratings[i]&&num[i-1]<=num[i]) num[i-1]=num[i]+1; sum+=num[i]; } sum+=num[0]; return sum; }};
0 0
- [Leetcode 135, Hard] Candy
- LeetCode: Candy [135]
- [leetcode 135] Candy
- LeetCode(135) Candy
- [LeetCode 135]Candy
- LeetCode 135 Candy
- leetcode || 135、Candy
- [leetcode-135]Candy(java)
- leetcode 135: Candy
- leetCode #135 Candy
- 【LeetCode-135】Candy
- Leetcode (135) Candy
- LeetCode(135)Candy
- Leetcode. 135 Candy(Hard)
- LeetCode 135 Candy
- LeetCode 135 : Candy
- leetcode 135 —— Candy
- LeetCode 135:candy 题解 Python
- SQL字符串处理函数大全
- Python 发个小邮件吧!
- UVa 10158 并查集+位操作
- opencv初识(一)
- QT 资料下载集合
- LeetCode(135)Candy
- 详解Handler机制和模拟Hangler
- 11.24 作业 Problem C: 平均数在哪儿?
- 欢迎使用CSDN-markdown编辑器
- Android开发学习笔记:浅谈WebView
- 简单的GreendaoDemo操作进行增删该查
- JSP基础
- laravel5 图片上传
- SQL中类似三元运算符的语句