135. 分发糖果

class Solution {
public:
    int candy(vector<int>& v) {
        // 1,3,4,5,2
        // 1,2,3,4,1
        // 
        vector<int>res(v.size(),1);
        for (int i = 1 ; i < v.size() ; i ++ ) {
            if (v[i] > v[i-1]) res[i] = res[i-1] + 1;
        }
        for (int i = v.size() - 2; i >= 0 ; i -- ) {
            if (v[i] > v[i+1] && res[i] <= res[i+1]) res[i] = res[i+1] + 1;
        }
        return accumulate(res.begin(),res.end(),0);
    }
};

WA了一发漏了&& res[i] <= res[i+1]