题解 | #分糖果问题#

#
# pick candy
# @param arr int整型一维数组 the array
# @return int整型
#
class Solution:
    def candy(self , arr ):
        # write code here
        if not arr:
            return 0
        n = len(arr)
        num = [1] * n 
        for i in range(1,n):
            if arr[i]>arr[i-1]:
                num[i] = num[i-1] + 1
        for i in range(n-2,-1,-1):
            if arr[i]>arr[i+1]:
                num[i] = max(num[i],num[i+1] + 1)
#         print(num)
        return sum(num)