思想:贪心
实现细节:
step1:都初始化为1,从左向右遍历保证比左边的糖果多(比左边评分高的话)。比如评分数:3 4 2 1,这样的话2和1都是1个糖果
step2:为了保证比右边的糖果多(比右边评分高的话),还要从右向左遍历取值取max(dp[i+1]+1, dp[i])
class Solution {
public:
int candy(vector<int>& ratings) {
int n = ratings.size();
vector<int> dp(n, 1);
for (int i = 1; i < n; ++i) {
if (ratings[i] > ratings[i - 1]) dp[i] = dp[i - 1] + 1;
}
for (int i = n - 2; i >= 0; --i) {
if (ratings[i] > ratings[i + 1]) dp[i] = max(dp[i], dp[i + 1] + 1);
}
return accumulate(dp.begin(), dp.end(), 0);
}
};