首页 > itarticle > [leetcode] problem 581 – shortest unsorted continuous subarray

[leetcode] problem 581 – shortest unsorted continuous subarray

admin 11月 13, 2020 0

Given an integer array, 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, too.

You need to find the shortest such subarray and output its length.

Example

Input: [2, 6, 4, 8, 10, 9, 15]

Output: 5

Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.

Note

Then length of the input array is in range [1, 10,000].
The input array may contain duplicates, so ascending order here means <=.

Code

public int (int[] nums) {
    int start = -1;
    int end = -2;
    int min = Integer.MAX_VALUE;
    int max = Integer.MIN_VALUE;

    for (int i = nums.length - 1; i >= 0; i--) {
        min = Math.min(min, nums[i]);
        
        if (nums[i] > min)
            start = i;
    }

    for (int i = 0; i < nums.length; i++) {
        max = Math.max(max, nums[i]);

        if (nums[i] < max)
            end = i;
    }

    return end - start + 1;
}