class Solution {
public:
int candy(vector<int> &ratings) {
if(ratings.size()==0) return 0;
if(ratings.size()==1) return 1;
vector<int> candy(ratings.size());
int m=0;
for(int i=0;i<ratings.size();i++){
candy[i]=1;
}
for(int i=1;i<ratings.size();i++){
if(ratings[i]>ratings[i-1]) candy[i]=candy[i-1]+1;
}
for(int i=ratings.size()-2;i>=0;i--){
if(ratings[i+1]<ratings[i] && candy[i+1]>=candy[i]) candy[i]=candy[i+1]+1;//判定條件需要注意
}
for(int i=0;i<ratings.size();i++){
m+=candy[i];
}
return m;
}
};