581. Shortest Unsorted Continuous Subarray

Medium

7.2K

246

Given an integer array `nums`

, you need to find one **continuous subarray** that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order.

Return *the shortest such subarray and output its length*.

**Example 1:**

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

**Example 2:**

Input:nums = [1,2,3,4]Output:0

**Example 3:**

Input:nums = [1]Output:0

**Constraints:**

`1 <= nums.length <= 10`

^{4}`-10`

^{5}<= nums[i] <= 10^{5}

`O(n)`

time complexity?Accepted

299.2K

Submissions

821.7K

Acceptance Rate

36.4%

Seen this question in a real interview before?

1/4

Yes

No

Discussion (0)

Related Topics

Copyright ©️ 2023 LeetCode All rights reserved