class Solution {
public:
int candy(vector<int>& ratings) {
vector<int> res;
int sum = 0;
for (int i = 0; i < ratings.size(); i++)
res.push_back(1);
for (int i = 1; i < ratings.size(); i++){
if (ratings[i] > ratings[i - 1])
res[i] = res[i - 1] + 1;
}
for (int i = ratings.size() - 1; i > 0; i--) {
if (ratings[i - 1] > ratings[i]) {
int temp = res[i] + 1;
res[i - 1] = max(res[i - 1], temp);
}
}
for (int i = 0; i < ratings.size(); i++)
sum += res[i];
return sum;
}
};
LeetCode135. 分发糖果
最新推荐文章于 2024-07-13 13:36:16 发布