Leetcode刷题：135

Candy

There are n children standing in a line. Each child is assigned a rating value given in the integer array ratings.

You are giving candies to these children subjected to the following requirements:

Each child must have at least one candy.
Children with a higher rating get more candies than their neighbors.
Return the minimum number of candies you need to have to distribute the candies to the children.

Example 1:

Input: ratings = [1,0,2]
Output: 5
Explanation: You can allocate to the first, second and third child with 2, 1, 2 candies respectively.
Example 2:

Input: ratings = [1,2,2]
Output: 4
Explanation: You can allocate to the first, second and third child with 1, 2, 1 candies respectively.
The third child gets 1 candy because it satisfies the above two conditions.

Constraints:

n == ratings.length
1 <= n <= 2 * 104
0 <= ratings[i] <= 2 * 104

有两种解法：

dp分析 from y总

仔细看了一眼，思路基本一致…

class Solution {
public:
    vector<int> f;
    vector<int> w;
    int n;

    int candy(vector<int>& ratings) {
        n = ratings.size();
        w = ratings;
        f.resize(n, -1);

        int res = 0;
        for (int i = 0; i < n; i ++ ) res += dp(i);
        return res;
    }

    int dp(int x) {
        if (f[x] != -1) return f[x];
        f[x] = 1;
        if (x && w[x - 1] < w[x]) f[x] = max(f[x], dp(x - 1) + 1);
        if (x + 1 < n && w[x + 1] < w[x]) f[x] = max(f[x], dp(x + 1) + 1);
        return f[x];
    }
};

作者：yxc
链接：https://www.acwing.com/activity/content/code/content/400742/
来源：AcWing
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。

贪心 from 高畅

这是一个更好理解的想法。将所有children的糖果初始化为1，从左到右遍历一遍，遇到右边比左边大的情况就将糖果数置为左边糖果数+1；再从右向左遍历，遇到左边比右边大，而糖果数不大的情况就置为右边糖果数+1

class Solution {
public:
    int candy(vector<int>& ratings) {
        int ans;
        int siz = ratings.size();
        if (siz <= 1) return siz;
        vector<int> num(siz, 1);
        for (int i = 1; i < siz; i++){
            if (ratings[i] > ratings[i - 1]) num[i] = num[i - 1] + 1;
        }
        for (int i = siz - 1; i > 0; i--){
            if (ratings[i] < ratings[i - 1]) num[i - 1] = max(num[i - 1], num[i] + 1);
        }
        ans = accumulate(num.begin(), num.end(), 0);
        return ans;
    }
};