[leetcode] Candy

class Solution {
public:
int candy(vector<int> &ratings) {
vector<int> fun(ratings.size());
int sum=0;
for(int i=0;i<ratings.size();++i){
sum+=solve(ratings,fun,i);
}
return sum;
}
int solve(const vector<int> &ratings,vector<int> &fun,int i){
if(fun[i]==0){
fun[i]=1;//至少一个
if(i>0&&ratings[i]>ratings[i-1]){
fun[i]=max(fun[i],solve(ratings,fun,i-1)+1);//至少多一个
}
if(i<ratings.size()-1&&ratings[i]>ratings[i+1]){
fun[i]=max(fun[i],solve(ratings,fun,i+1)+1);
}
}
return fun[i];
}
};