Leetcode 135. Candy

问题

https://leetcode.com/problems/candy/

解法

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