shortest-unsorted-continuous-subarray

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>, you need to find one continuous subarray such that if you only sort this subarray in non-decreasing order, then the whole array will be sorted in non-decreasing order.

Return the shortest such subarray and output its length.

&nbsp;
Example 1:

<pre>
Input: nums = [2,6,4,8,10,9,15]
Output: 5
Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.
</pre>

Example 2:

<pre>
Input: nums = [1,2,3,4]
Output: 0
</pre>

Example 3:

<pre>
Input: nums = [1]
Output: 0
</pre>

&nbsp;
Constraints:

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

&nbsp;
Follow up: Can you solve it in <code>O(n)</code> time complexity?

findUnsortedSubarray

Shortest Unsorted Continuous Subarray

Stack

Greedy

Array

Two Pointers

Sorting

Monotonic Stack

给你一个整数数组 <code>nums</code> ，你需要找出一个 连续子数组 ，如果对这个子数组进行升序排序，那么整个数组都会变为升序排序。

请你找出符合题意的 最短 子数组，并输出它的长度。

 

<div class="original__bRMd">
<div>
示例 1：

<pre>
输入：nums = [2,6,4,8,10,9,15]
输出：5
解释：你只需要对 [6, 4, 8, 10, 9] 进行升序排序，那么整个表都会变为升序排序。
</pre>

示例 2：

<pre>
输入：nums = [1,2,3,4]
输出：0
</pre>

示例 3：

<pre>
输入：nums = [1]
输出：0
</pre>

 

提示：

<ul>
	<li><code>1 <= nums.length <= 104</code></li>
	<li><code>-105 <= nums[i] <= 105</code></li>
</ul>

 

进阶：你可以设计一个时间复杂度为 <code>O(n)</code> 的解决方案吗？
</div>
</div>