maximum-width-ramp

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

A ramp in an integer array <code>nums</code> is a pair <code>(i, j)</code> for which <code>i &lt; j</code> and <code>nums[i] &lt;= nums[j]</code>. The width of such a ramp is <code>j - i</code>.

Given an integer array <code>nums</code>, return the maximum width of a ramp in <code>nums</code>. If there is no ramp in <code>nums</code>, return <code>0</code>.

&nbsp;
Example 1:

<pre>
Input: nums = [6,0,8,2,1,5]
Output: 4
Explanation: The maximum width ramp is achieved at (i, j) = (1, 5): nums[1] = 0 and nums[5] = 5.
</pre>

Example 2:

<pre>
Input: nums = [9,8,1,0,1,9,4,0,4,1]
Output: 7
Explanation: The maximum width ramp is achieved at (i, j) = (2, 9): nums[2] = 1 and nums[9] = 1.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= nums.length &lt;= 5 * 104</code></li>
	<li><code>0 &lt;= nums[i] &lt;= 5 * 104</code></li>
</ul>

maxWidthRamp

Maximum Width Ramp

Stack

Array

Two Pointers

Monotonic Stack

给定一个整数数组&nbsp;<code>A</code>，坡是元组&nbsp;<code>(i, j)</code>，其中&nbsp;&nbsp;<code>i &lt; j</code>&nbsp;且&nbsp;<code>A[i] &lt;= A[j]</code>。这样的坡的宽度为&nbsp;<code>j - i</code>。

找出&nbsp;<code>A</code>&nbsp;中的坡的最大宽度，如果不存在，返回 0 。

&nbsp;

示例 1：

<pre>输入：[6,0,8,2,1,5]
输出：4
解释：
最大宽度的坡为 (i, j) = (1, 5): A[1] = 0 且 A[5] = 5.
</pre>

示例 2：

<pre>输入：[9,8,1,0,1,9,4,0,4,1]
输出：7
解释：
最大宽度的坡为 (i, j) = (2, 9): A[2] = 1 且 A[9] = 1.
</pre>

&nbsp;

提示：

<ol>
	<li><code>2 &lt;= A.length &lt;= 50000</code></li>
	<li><code>0 &lt;= A[i] &lt;= 50000</code></li>
</ol>

&nbsp;