解题思路:一个位置,如果不高于它左右两边,则一定为1,然后以这些点作为起点,进行BFS,每次更新邻居中比自己高的手中的糖果值为自己的+1,如果邻居的被更新了,则放入队列。最后累加所有人手中的糖果数。
class Solution {
public:
int candy(vector<int>& ratings) {
int n = ratings.size();
int* dp = new int[n];
for (int i = 0; i < n; i++) dp[i] = 0;
queue<int> que;
for (int i = 0; i < n; i++) {
if ((i == 0 || ratings[i-1] >= ratings[i])
&& (i == n-1 || ratings[i+1] >= ratings[i]) ) {
dp[i] = 1;
que.push(i);
}
}
while (!que.empty()) {
int u = que.front();
que.pop();
if (u && ratings[u-1] > ratings[u] && dp[u-1] < dp[u]+1) {
dp[u-1] = dp[u] + 1;
que.push(u-1);
}
if (u + 1 < n && ratings[u+1] > ratings[u] && dp[u+1] < dp[u] + 1) {
dp[u+1] = dp[u] + 1;
que.push(u+1);
}
}
int ans = 0;
for (int i = 0; i < n; i++) ans += dp[i];
delete[] dp;
return ans;
}
};