# 0135-candy Try it on leetcode ## Description

There are n children standing in a line. Each child is assigned a rating value given in the integer array ratings.

You are giving candies to these children subjected to the following requirements:

Return the minimum number of candies you need to have to distribute the candies to the children.

 

Example 1:

Input: ratings = [1,0,2]
Output: 5
Explanation: You can allocate to the first, second and third child with 2, 1, 2 candies respectively.

Example 2:

Input: ratings = [1,2,2]
Output: 4
Explanation: You can allocate to the first, second and third child with 1, 2, 1 candies respectively.
The third child gets 1 candy because it satisfies the above two conditions.

 

Constraints:

## Solution(Python) ```Python class Solution: def candy(self, ratings: List[int]) -> int: # [1 0 2] # min = 1 # 111 => 3 # # left to right # 1 3 4 2 # o -> 1 # 1 -> 3 > 1 : 1+1 = 2 # 2 -> 4 > 3 : 2 + 1 = 3 # 3 -> 2 < 4 : 1 # 1 2 3 1 # right to left # 3 -> 1 # 2 -> 4 > 2 = 2 # 1 -> 3 < 4= 1 # 0 -> 1 < 3 = 1 # 1 1 2 1 # n = len(ratings) candies = [1] * n for i in range(1, n): if ratings[i] > ratings[i-1]: candies[i] = candies[i-1] + 1 for i in range(n-2, -1 ,-1): if ratings[i+1] < ratings[i]: candies[i] = max(candies[i], candies[i + 1] + 1 ) return sum(candies) ```