candy

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

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

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

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

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

&nbsp;
Example 1:

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

Example 2:

<pre>
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.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>n == ratings.length</code></li>
	<li><code>1 &lt;= n &lt;= 2 * 104</code></li>
	<li><code>0 &lt;= ratings[i] &lt;= 2 * 104</code></li>
</ul>

Candy

Minimize Maximum Value in a Grid

minimize-maximum-value-in-a-grid

最小化网格中的最大值

Minimum Number of Operations to Satisfy Conditions

minimum-number-of-operations-to-satisfy-conditions

使矩阵满足条件的最少操作次数

Check if Grid Satisfies Conditions

check-if-grid-satisfies-conditions

判断矩阵是否满足条件

Greedy

Array

<code>n</code> 个孩子站成一排。给你一个整数数组 <code>ratings</code> 表示每个孩子的评分。

你需要按照以下要求，给这些孩子分发糖果：

<ul>
	<li>每个孩子至少分配到 <code>1</code> 个糖果。</li>
	<li>相邻两个孩子评分更高的孩子会获得更多的糖果。</li>
</ul>

请你给每个孩子分发糖果，计算并返回需要准备的 最少糖果数目 。

&nbsp;

示例&nbsp;1：

<pre>
输入：ratings = [1,0,2]
输出：5
解释：你可以分别给第一个、第二个、第三个孩子分发 2、1、2 颗糖果。
</pre>

示例&nbsp;2：

<pre>
输入：ratings = [1,2,2]
输出：4
解释：你可以分别给第一个、第二个、第三个孩子分发 1、2、1 颗糖果。
 第三个孩子只得到 1 颗糖果，这满足题面中的两个条件。</pre>

&nbsp;

提示：

<ul>
	<li><code>n == ratings.length</code></li>
	<li><code>1 &lt;= n &lt;= 2 * 104</code></li>
	<li><code>0 &lt;= ratings[i] &lt;= 2 * 104</code></li>
</ul>