class Solution {
public:
int candy(vector<int> &ratings) {
vector<int>num;
num.assign(ratings.size(),1);
for(int i=1;i<ratings.size();i++)
{
if(ratings[i]>ratings[i-1])
num[i]=num[i-1]+1;
}
if(ratings[0]>ratings[1])
num[0]=num[1]+1;
for(int i=ratings.size()-1;i>=1;i--)
{
if(ratings[i]<ratings[i-1]&&num[i-1]<=num[i])
num[i-1]=num[i]+1;
}
int count=0;
for(int i=0;i<num.size();i++)
count=count+num[i];
return count;
}
};
这题挺简单的,连我都会
candy leetcode
最新推荐文章于 2019-04-29 01:12:32 发布