题目:biubiu
题意:老师分发糖果,要求每个孩子最少有一颗糖果,但是要求相邻的孩子分数高的孩子得到的糖果多。
方法一:为了保证相邻的孩子分数高的孩子得到的糖果多,我先遍历一遍,对于出现的升序先分配糖果,如果是降序或者分数相等,先分配一个糖果,然后逆序遍历一遍,同样对升序也就是降序进行处理。
class Solution {
public:
int candy(vector<int>& ratings) {
int ans=0;
vector<int>dp(ratings.size(),0);
dp[0]=1;
for(int i=1;i<ratings.size();i++){
if(ratings[i]>ratings[i-1]){
dp[i]=max(dp[i],dp[i-1]+1);
}else{
dp[i]=1;
}
}
ans+=dp[ratings.size()-1];
for(int i=ratings.size()-2;i>=0;i--){
if(ratings[i]>ratings[i+1]){
dp[i]=max(dp[i],dp[i+1]+1);
}
ans+=dp[i];
}
return ans;
}
};
方法二:常量空间遍历(官方题解)
class Solution {
public:
int candy(vector<int>& ratings) {
int n = ratings.size();
int ret = 1;
int inc = 1, dec = 0, pre = 1;
for (int i = 1; i < n; i++) {
if (ratings[i] >= ratings[i - 1]) {
dec = 0;
pre = ratings[i] == ratings[i - 1] ? 1 : pre + 1;
ret += pre;
inc = pre;
} else {
dec++;
if (dec == inc) {
dec++;
}
ret += dec;
pre = 1;
}
}
return ret;
}
};