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?
先处理右侧大于左侧的情况,初始值均为0,如果右侧大于左侧,那么右侧至少比左侧大1,因此右面较大的取其左侧的值加一就是最小的;否则,就将右侧置为最小的。需要注意的是连续元素重复的情况:
1 4 4 1 5 3 2
这种情况下从左至右一次遍历的结果应该为:
0 1 0 0 1 0 0
由于右面的4并不大于左侧的4,因此右面的4最少可以给0。
我们再看左侧大于右侧的情况:同样,如果左侧的比右侧的大,则至少应该置为右侧的值+1,但由于左侧原有的值可能比右侧值+1更大,为了同时满足两边的要求,取最大者。
因此上面的再从右至左处理一遍之后变为:
0 1 1 0 2 1 0
由于每个小朋友最少有一颗糖,在最后结果每个人都加上1即可。
class Solution {
public:
int candy(vector<int> &ratings) {
int n = ratings.size();
vector<int> nums(n, 0);
for (int i = 1; i < n; i++)
{
if (ratings[i] > ratings[i - 1])
nums[i] = nums[i - 1] + 1;
else
nums[i] = 0;
}
for (int i = n - 2; i >= 0; i--)
{
if (ratings[i] > ratings[i + 1])
nums[i] = max(nums[i], nums[i + 1] + 1);
}
return accumulate(nums.begin(), nums.end(), n);
}
};