public int candy(int [] ratings)
{
assert(ratings != null && ratings.length > 0);
int children[] = new int[ratings.length];
children[0] = 1;
for(int i = 1; i < ratings.length; i++)
{
children[i] = ratings[i-1] < ratings[i] ? children[i-1]+1 : 1;
}
for(int i = ratings.length-2; i >= 0; i--)
{
if(ratings[i] > ratings[i+1] && children[i] <= children[i+1])
{
children[i] = children[i+1] + 1;
}
}
int sum = 0;
for(int i = 0; i < children.length; i++)
{
sum += children[i];
}
return sum;
}
[leetcode] Candy Java
最新推荐文章于 2023-02-28 14:31:32 发布