Skip to content

Latest commit

 

History

History
69 lines (35 loc) · 1.18 KB

README_EN.md

File metadata and controls

69 lines (35 loc) · 1.18 KB

中文文档

Description

There are N children standing in a line. Each child is assigned a rating value.

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

    <li>Each child must have at least one candy.</li>
    
    <li>Children with a higher rating get more candies than their neighbors.</li>
    

What is the minimum candies you must give?

Example 1:

Input: [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: [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.

Solutions

Python3

Java

...