LeetCode: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 size = ratings.size();
			vector<int> number(size,1);
			for(int i = 1;i < size;i++)
			{
				if(ratings[i] > ratings[i-1])
					number[i] = number[i-1] + 1;
			}
			for(int i = size-1;i > 0;i--)
			{
				if(ratings[i-1] > ratings[i])
					number[i-1] = number[i] + 1 > number[i-1] ? number[i] + 1 : number[i-1];
			}
			int sum = 0;
			for(int i = 0;i < size;i++)
				sum = sum + number[i];
			return sum;
		}
};

LeetCode:Candy

标签：

原文地址：http://blog.csdn.net/yao_wust/article/details/45845237