1
var findUnsortedSubarray = function (nums) {
2
let left = 0;
3
let right = nums.length - 1;
4
const target = [...nums].sort((a, b) => a - b);
5

6
while (left < right && nums[left] === target[left]) left += 1;
7
while (right > left && nums[right] === target[right]) right -= 1;
8
const result = right - left;
9

10
return result === 0 ? 0 : result + 1;
11
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0