class Solution {
public:
int candy(vector<int>& ratings) {
int bef=0,aft=0;
int size=ratings.size();
vector<int> candy(size,1);
int count=0;
for(int i=1;i<size;i++){
if(ratings[i]>ratings[i-1]){candy[i]=candy[i-1]+1;}
}
for(int j=size-2;j>=0;j--){
if(ratings[j]>ratings[j+1]){candy[j]=max(candy[j],candy[j+1]+1);}
}
for(int i=0;i<size;i++){
count+=candy[i];
}
return count;
}
};
// https://leetcode.cn/problems/candy/solutions/533150/fen-fa-tang-guo-by-leetcode-solution-f01p
// https://leetcode.cn/problems/candy/solutions/854965/dai-ma-sui-xiang-lu-135-fen-fa-tang-guo-f7ezy
day08:135. 分发糖果
最新推荐文章于 2024-07-14 11:23:58 发布