LeetCode OJ - Candy
来源:互联网 发布:《优化重组卷》数学 编辑:程序博客网 时间:2024/06/07 07:12
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?
貌似很多题都是两边扫描啊,或者多编
int candy(vector<int> &ratings) { if(ratings.empty()) return 0; vector<int> candy(ratings.size(), 1); for(int i = 0; i < ratings.size() - 1; i++) { if(ratings[i] < ratings[i + 1]) candy[i + 1] = candy[i] + 1; } for(int i = ratings.size() - 2; i > 0; i--) { if(ratings[i] > ratings[i + 1] && candy[i] < candy[i + 1] + 1) candy[i] = candy[i + 1] + 1; } int ret = 0; for(int i = 0; i < candy.size(); i++) { ret += candy[i]; } return ret;}
0 0
- LeetCode OJ:Candy
- LeetCode OJ - Candy
- LeetCode OJ - Candy
- LeetCode OJ Candy
- LeetCode OJ——Candy
- [LeetCode OJ] Candy 解题报告
- LeetCode OJ 之 Candy (糖果数量)
- Leetcode: Candy
- LeetCode:Candy
- [leetcode]Candy
- Leetcode: Candy
- 【leetcode】Candy
- LeetCode:Candy
- [LeetCode] Candy
- [LeetCode]Candy
- [LeetCode] Candy
- 【LeetCode】Candy
- LeetCode | Candy
- Unity3D 运行时 动态加载 预设 prefab
- ipv6 编码
- div和span的区别
- LCD驱动开发思路
- send-mail: warning: inet_protocols: IPv6 support is disabled错误解决
- LeetCode OJ - Candy
- 理解 pkg-config 工具
- SQL Server 中如何更改sa的密码
- 【Android】实现Mac中的Cover Flow效果
- Android ListView 去除边缘阴影、选中色、拖动背景色等(android:cacheColorHint="#00000000")
- 安卓开发环境变量的配置
- Redhat Enterprise Linux server 5 安装Oracle10g 错误解决
- 怎么玩COC不掉线的办法E9加速器分享
- python实践1