leetcode - Candy

最新推荐文章于 2021-07-26 04:49:30 发布

AkibaTakuya

最新推荐文章于 2021-07-26 04:49:30 发布

阅读量401

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/AkibaTakuya/article/details/39584637

版权

leetcode 专栏收录该内容

155 篇文章 0 订阅

订阅专栏

class Solution {
public:
    int candy(std::vector<int> &ratings) {
		std::vector<int> ans(ratings.size(),0);
		ans[0] = 1;
		int sz = ratings.size();
		for (int i = 1; i < sz; i++)
		{
			if(ratings[i-1] < ratings[i])
			{
				ans[i] = ans[i-1] + 1;
			}
			else
			{
				ans[i] = 1;
			}
		}
		for(int i = sz - 2; i >= 0; i--)
		{
			if(ratings[i+1] < ratings[i])
			{
				int t = ans[i+1] + 1;
				ans[i] = t > ans[i] ? t : ans[i];
			}
		}
		int s = 0;
		for (int i = 0; i < sz; i++)
		{
			s += ans[i];
		}
		return s;
    }
};