maximum-gap

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array <code>nums</code>, return the maximum difference between two successive elements in its sorted form. If the array contains less than two elements, return <code>0</code>.

You must write an algorithm that runs in linear time and uses linear extra space.

&nbsp;
Example 1:

<pre>
Input: nums = [3,6,9,1]
Output: 3
Explanation: The sorted form of the array is [1,3,6,9], either (3,6) or (6,9) has the maximum difference 3.
</pre>

Example 2:

<pre>
Input: nums = [10]
Output: 0
Explanation: The array contains less than 2 elements, therefore return 0.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 109</code></li>
</ul>

maximumGap

Maximum Gap

Widest Vertical Area Between Two Points Containing No Points

widest-vertical-area-between-two-points-containing-no-points

两点之间不包含任何点的最宽垂直区域

Maximum Consecutive Floors Without Special Floors

maximum-consecutive-floors-without-special-floors

不含特殊楼层的最大连续楼层数

Array

Bucket Sort

Radix Sort

Sorting

给定一个无序的数组&nbsp;<code>nums</code>，返回 数组在排序之后，相邻元素之间最大的差值 。如果数组元素个数小于 2，则返回 <code>0</code> 。

您必须编写一个在「线性时间」内运行并使用「线性额外空间」的算法。

&nbsp;

示例&nbsp;1:

<pre>
输入: nums = [3,6,9,1]
输出: 3
解释: 排序后的数组是 [1,3,6,9], 其中相邻元素 (3,6) 和 (6,9) 之间都存在最大差值 3。</pre>

示例&nbsp;2:

<pre>
输入: nums = [10]
输出: 0
解释: 数组元素个数小于 2，因此返回 0。</pre>

&nbsp;

提示:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 109</code></li>
</ul>