135. Candy.md

135. Candy

https://leetcode.com/problems/candy/

solution

class Solution:
    def candy(self, ratings: List[int]) -> int:
        res = [1 for _ in range(len(ratings))]
        for i in range(1, len(ratings)):
            if ratings[i] > ratings[i-1]:
                res[i] = res[i-1] + 1

        for j in range(len(ratings)-1, 0, -1):
            if ratings[j] < ratings[j-1]:
                res[j-1] = max(res[j-1], res[j]+1)

        return sum(res)

时间复杂度：O()
空间复杂度：O()