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> res(ratings.size(), 1);
for(int i=0;i<ratings.size()-1;++i)
{
if (ratings[i+1] > ratings[i])
res[i+1] = res[i]+1;
}
for(int i=ratings.size()-1;i>=0;--i)
{
if (ratings[i-1] > ratings[i])
res[i-1] = res[i]+1;
}
return accumulate(res.begin(), res.end(), 0);
}
};
测试
#include<iostream>
#include<vector>
#include <numeric>
using namespace std;
class Solution {
public:
int candy(vector<int> &ratings)
{
vector<int> res(ratings.size(), 1);
for(int i=0;i<ratings.size()-1;++i)
{
if (ratings[i+1] > ratings[i])
res[i+1] = res[i]+1;
}
for(int i=ratings.size()-1;i>=0;--i)
{
if (ratings[i-1] > ratings[i]&&res[i-1]<=res[i])
res[i-1] = res[i]+1;
}
return accumulate(res.begin(), res.end(), 0);
}
};
int main()
{
Solution s;
int A[] = {4,2,3,4,1};
vector<int> vec(A, A+5);
cout<<s.candy(vec)<<endl;
}