LeetCode: Candy
来源:互联网 发布:上海大学云计算平台 编辑:程序博客网 时间:2024/04/30 01:42
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?
class Solution {public: int candy(vector<int> &ratings) { vector<int> candy(ratings.size(), 1); int result = 0; for(int i = 1; i < ratings.size(); i++) { if(ratings[i] > ratings[i-1]&& candy[i] <= candy[i-1]) { candy[i] = candy[i-1] + 1; } } for(int i = ratings.size() -2; i >= 0; i--) { if(ratings[i] > ratings[i + 1] && candy[i] <= candy[i+1]) { candy[i] = candy[i + 1] + 1; } } for(int i = 0; i < candy.size(); i++) result += candy[i]; return result; }};
Round 2:
class Solution {public: int candy(vector<int>& ratings) { vector<int> candies(ratings.size(), 1); int result = 0; for(int i = 1; i < ratings.size(); i++){ if(ratings[i] > ratings[i-1] && candies[i] <= candies[i-1]){ candies[i] = candies[i-1] + 1; } } for(int i = ratings.size()-2; i >= 0; i--){ if(ratings[i] > ratings[i+1] && candies[i] <= candies[i+1]){ candies[i] = candies[i+1] + 1; } result += candies[i]; } result += candies[ratings.size()-1]; return result; }};
0 0
- Leetcode: Candy
- LeetCode:Candy
- [leetcode]Candy
- Leetcode: Candy
- 【leetcode】Candy
- LeetCode:Candy
- [LeetCode] Candy
- [LeetCode]Candy
- [LeetCode] Candy
- 【LeetCode】Candy
- LeetCode | Candy
- Leetcode: Candy
- Candy - LeetCode
- leetcode Candy
- LeetCode Candy
- candy leetcode
- Candy -- LeetCode
- [LeetCode] Candy
- 版本适配
- Office 365 - SharePoint 2013 Online之添加App开发工具Napa
- 优秀的有趣的博客~值得一看
- 工作日志2014-08-26
- TransactionTooLargeException崩溃的解决
- LeetCode: Candy
- ActiveMQ传输文件的几种方式原理与优劣
- Office 365 - SharePoint 2013 Online 之应用程序开发
- 如何设置样式为一个漏口的四边形
- codeigniter + nginx 如何配置
- Android 自定义title
- SVN问题总总结
- SharePoint 2013 列表关于大数据的测试
- SharePoint 2013 列表关于大数据的测试<二>