Shortest Unsorted Continuous Subarray
Given an integer array nums, 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.
Follow up: Can you solve it in O(n) time complexity?
Example 1
Input
nums = [2,6,4,8,10,9,15]Output
5You 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
0The array is already sorted in non-decreasing order, so no subarray needs to be sorted.
Constraints
- 1 <= nums.length <= 10^4
- -10^5 <= nums[i] <= 10^5