class Solution(object): def candy(self, ratings): """ :type ratings: List[int] :rtype: int """ # https://discuss.leetcode.com/topic/5243/a-simple-solution if ratings is None or len(ratings) == 0: return 0 ls = len(ratings) num =  * ls for i in range(1, ls): if ratings[i] > ratings[i - 1]: num[i] = num[i - 1] + 1 for i in range(ls - 1, 0, -1): if ratings[i - 1] > ratings[i]: num[i - 1] = max(num[i] + 1, num[i - 1]) return sum(num)
Leetcode 135 Candy problem solution in python3 with explanation. This is the best place to expand your knowledge and get prepared for your next interview.
Feedback is the most important part of any website.
If you have any query, suggestion or feedback, Please feel free to contact us.