Shortest Unsorted Continuous Subarray

Problem statement

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 <= 104
• -105 <= nums[i] <= 105

Follow up: Can you solve it in O(n) time complexity?

My solution

/**
 * @param {number[]} nums
 * @return {number}
 */
var findUnsortedSubarray = function(nums) {
    let left = -1
    let right = -1
    
    for (let i = 0; i < nums.length; i++) {
        if (nums[i] > nums[i + 1]) {
            left = i;
            break;
        }
    }
    
    if (left === -1) {
        return 0;
    }
    
    for (let i = nums.length - 1; i >= 0; i--) {
        if (nums[i - 1] > nums[i]) {
            right = i;
            break;
        }
    }
    
    let min = Number.MAX_SAFE_INTEGER;
    let max = Number.MIN_SAFE_INTEGER;
    
    for (let i = left; i <= right; i++) {
        min = Math.min(min, nums[i]);
        max = Math.max(max, nums[i])
    }
    
    while (left > 0 && nums[left - 1] > min) {
        left--
    }
    
    while (right < nums.length && nums[right + 1] < max) {
        right++
    }
    
    return right - left + 1
};