首页 > 代码库 > Candy
Candy
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) { int cap = ratings.size(); int* candy = new int[cap]; fill(candy , candy + cap , 0); int k = 1; for(int i = 1 ; i < cap ; i++){ if(ratings[i] > ratings[i - 1]){ candy[i] = max(k++ , candy[i]); }else{ k = 1; } } k = 1; for(int i = cap -2 ; i >= 0 ; i --){ if(ratings[i] > ratings[i + 1]){ candy[i] = max(k++ , candy[i]); }else{ k = 1; } } int ans = cap; for(int i = 0 ; i < cap ; i++) ans += candy[i]; return ans; }};
Candy
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。