# Leetcode 135 - Candy

Note:

• How to be greedy?
• From left to right, make result[i] > result[i-1] if rating[i] > ratings[i-1]. Then from right to left, make result[i] > result[i+1] if ratings[i] > ratings[i+1]

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:

• Each child must have at least one candy.
• Children with a higher rating get more candies than their neighbors.
Return the minimum number of candies you need to have to distribute the candies to the children.

Example