Eric 的小站

1
class Solution {
2
public:
3
    int candy(vector<int>& ratings) {
4
        int n = ratings.size();
5
        vector<int> left(n);
6
        for (int i = 0; i < n; i++) {
7
            if (i > 0 && ratings[i] > ratings[i - 1]) {
8
                left[i] = left[i - 1] + 1;
9
            }
10
            else {
11
                left[i] = 1;
12
            }
13
        }
14
        int right = 0, ret = 0;
15
        for (int i = n - 1; i >= 0; i--) {
16
            if (i < n - 1 && ratings[i] > ratings[i + 1]) {
17
                right++;
18
            }
19
            else {
20
                right = 1;
21
            }
22
            ret += max(left[i], right);
23
        }
24
        return ret;
25
    }
26
};