leetcode135：candy

先从左到右遍历一遍，然后反过来

class Solution(object):
    def candy(self,ratings):
        n = len(ratings)
        dp = [1 for i  in range(n)]
        sum = 0
        for i in range(n):
            if ratings[i]>ratings[i-1]:
                dp[i] = dp[i-1]+1


        for i in range(n-2,-1,-1):
            if ratings[i]>ratings[i+1]and dp[i]<dp[i+1]:
                dp[i]=dp[i+1]+1

        for i in n:
            sum += dp[i]
            return sum

#调用
s = Solution()
print(s.candy([1,0,2]))

运行结果与测试：