666. Shortest Unsorted Continuous Subarray

Given an array nums, find the shortest contiguous subarray such that sorting just that subarray makes the whole array sorted in ascending order, and return its length (0 if already sorted). The input is JSON {nums}.

Input: JSON {nums}.

Output: Integer — the length of the shortest such subarray.

Examples

Input: {"nums":[2,6,4,8,10,9,15]}
Output: 5
Explanation: Sorting indices 1..5 sorts everything.

Input: {"nums":[1,2,3,4]}
Output: 0
Explanation: Already sorted.

Input: {"nums":[2,1]}
Output: 2
Explanation: Swap the two.

Constraints

• 1<=n<=10^4

Asked by