Package g0501_0600.s0581_shortest_unsorted_continuous_subarray

Class Solution

java.lang.Object

g0501_0600.s0581_shortest_unsorted_continuous_subarray.Solution

public class Solution
extends Object

581 - Shortest Unsorted Continuous Subarray.<p>Medium</p> <p>Given an integer array <code>nums</code>, you need to find one <strong>continuous subarray</strong> that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order.</p> <p>Return <em>the shortest such subarray and output its length</em>.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [2,6,4,8,10,9,15]</p> <p><strong>Output:</strong> 5</p> <p><strong>Explanation:</strong> You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [1,2,3,4]</p> <p><strong>Output:</strong> 0</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [1]</p> <p><strong>Output:</strong> 0</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 10⁴</code></li> <li><code>-10⁵ <= nums[i] <= 10⁵</code></li> </ul> <p><strong>Follow up:</strong> Can you solve it in <code>O(n)</code> time complexity?</p>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	findUnsortedSubarray(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

findUnsortedSubarray

public int findUnsortedSubarray(int[] nums)