135. Candy [Hard] DP
2019-05-05 本文已影响0人
一个想当大佬的菜鸡
135. Candy
![](https://img.haomeiwen.com/i17368230/34ded0b825df4525.png)
class Solution(object):
def candy(self, ratings):
"""
:type ratings: List[int]
:rtype: int
"""
dp = [1 for i in range(len(ratings))]
for i in range(1, len(ratings)):
if ratings[i] > ratings[i-1] and dp[i] <= dp[i-1]:
dp[i] = dp[i-1] + 1
for i in range(len(ratings)-2, -1, -1):
if ratings[i] > ratings[i+1] and dp[i] <= dp[i+1]:
dp[i] = dp[i+1] + 1
return sum(dp)