leetCode---Candy
2017-06-20 11:47
381 查看
一. 题目:CandyThere 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 len = ratings.size(), res = 0, i;
if(len>0){
vector<int> number(len,0);
number[0] = 1;
for(i=1; i<len;++i)
number[i] = ratings[i]>ratings[i-1]?number[i-1]+1:1;
for(i=len-2, res = number[len-1]; i>=0;--i){
if( (ratings[i]>ratings[i+1]) && number[i]<(number[i+1]+1) )
number[i] = number[i+1]+1;
res += number[i];
}
}
return res;
}
};
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?
二. 思路分析
题目大意:有N个孩子站在一条线上。每个孩子被分配一个评分值。你给这些孩子的糖果受到以下要求:每个孩子必须至少有一个糖果。具有较高评级的儿童比邻居获得更多的糖果。你必须给予的最少糖果是什么? 思路分析:这是一个贪心算法的应用,先从左到右扫描一遍,使得右边比左边得分高的小朋友糖果数比左边多。再从右到左扫描一遍,使得左边比右边得分高的小朋友糖果数比右边多。代码如下:
class Solution {
public:
int candy(vector<int>& ratings) {
int len = ratings.size(), res = 0, i;
if(len>0){
vector<int> number(len,0);
number[0] = 1;
for(i=1; i<len;++i)
number[i] = ratings[i]>ratings[i-1]?number[i-1]+1:1;
for(i=len-2, res = number[len-1]; i>=0;--i){
if( (ratings[i]>ratings[i+1]) && number[i]<(number[i+1]+1) )
number[i] = number[i+1]+1;
res += number[i];
}
}
return res;
}
};
相关文章推荐
- LeetCode:Candy
- [LeetCode] Candy (分糖果),时间复杂度O(n),空间复杂度为O(1),且只需遍历一次的实现
- [leetcode] Candy
- [Leetcode] Candy
- LeetCode135 Candy
- [LeetCode]Candy
- LeetCode:Candy
- [leetcode]Candy @ Python
- Candy:对样例存在困惑的一道leetcode
- Java for LeetCode 135 Candy
- [LeetCode] 130: Candy
- LeetCode: Candy
- leetcode -day9 Candy & Gas Station & Binary Tree Maximum Path Sum
- 【LeetCode】Candy
- #leetcode#Candy
- 6 Candy_Leetcode
- Candy [leetcode]
- Candy -- LeetCode
- [LeetCode]Candy
- [LeetCode] Candy