LeetCode OJ Candy
来源:互联网 发布:游戏中常用算法 编辑:程序博客网 时间:2024/05/17 07:01
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?
刚开始还以为很简单- -。
后来做了好久。
后来看到了大神的好简单代码- -。
https://oj.leetcode.com/discuss/10046/share-my-short-solution
class Solution {public: int candy(vector<int> &ratings) { int ans = 0; int * lc = new int[ratings.size()]; int * rc = new int[ratings.size()]; for (int i = 0; i < ratings.size(); i++) lc[i] = rc[i] = 1; for (int i = 1; i < ratings.size(); i++) if (ratings[i - 1] < ratings[i]) lc[i] = lc[i - 1] + 1; for (int i = ratings.size() - 2; i >= 0; i--) if (ratings[i] > ratings[i + 1]) rc[i] = rc[i + 1] + 1; for (int i = 0; i < ratings.size(); i++) ans += max(lc[i], rc[i]); return ans; }};
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
- vim note(6)--vim的一个较全的介绍(转)
- LeetCode OJ Regular Expression Matching
- Nginx的Web缓存服务
- 对你的你的给你搞的那么多个
- java语言GUI编程之TextField持有对方引用2
- LeetCode OJ Candy
- 路径问题大盘点
- spring使用title2或title3
- LeetCode OJ Scramble String
- LeetCode OJ Find Minimum in Rotated Sorted Array II
- vb.net机房收费系统重构——配置文件
- C# OPC客户端远程连接RSLinx OPC服务器
- ACM--steps-dyx--1.2.3--find your present (2)(异或)
- centOS 5.8下,手动将静态ip修改为动态ip