[Leetcode][python]Candy/分发糖果

我的输入
[1,0,2]
我的标准输出
[1, 1, 2]
[2, 1, 2]
我的答案
5

class Solution(object):
    def candy(self, ratings):
        """
        :type ratings: List[int]
        :rtype: int
        """
        n = len(ratings)
        result = [1 for __ in range(n)]
        for i in range(1, n):
            if ratings[i-1] < ratings[i]:
                result[i] = result[i-1] + 1
        # 要从后面开始扫描，将降序的较高孩子分得更多的糖果。
        for j in range(n-2, -1, -1):
            if ratings[j] > ratings[j+1]:
                result[j] = max(result[j], result[j+1] + 1)
        return sum(result)