您的位置:首页 > 其它

Lintcode:分糖果

2016-07-24 22:49 357 查看
Lintcode:分糖果这里写链接内容

class Solution:
# @param {int[]} ratings Children's ratings
# @return {int} the minimum candies you must give
def candy(self, ratings):
# Write your code here
n = len(ratings)
dp = [1 for i in range(n)]
for i in range(0, n-1):
if ratings[i] < ratings[i+1]:
dp[i+1] = max(dp[i+1], dp[i]+1)
for i in range(n-1, 0, -1):
if ratings[i-1] > ratings[i]:
dp[i-1] = max(dp[i-1], dp[i] + 1)
return sum(dp)
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: