581. Shortest Unsorted Continuous Subarray

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.

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
Example 1:

Input: nums = [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.

Example 2:

Input: nums = [1,2,3,4]
Output: 0

Example 3:

Input: nums = [1]
Output: 0

Constraints:

1 <= nums.length <= 10^4
-10^5 <= nums[i] <= 10^5

Solution

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
class Solution {
    
    /**
    
    [2,6,4,8,10,9,15]
    
    
    [2,6,4,13,10,12,15]
    
    [2,4,5,6,3] - increasing stack
    
    (2,4,5,6,3!)
    (2!)
    
    (15,12,10,13!) decreasing stack
    
    (15,13)
    
    
    
    */
    
    public int findUnsortedSubarray(int[] nums) {
        
        Stack<Integer> incStack = new Stack<>();
        
        int lo = nums.length;
        for (int i = 0; i < nums.length; i++) {
            while (incStack.size() > 0 && nums[i] < nums[incStack.peek()]) {
                lo = Math.min(lo, incStack.pop());
            }
            incStack.push(i);
        }
        
        Stack<Integer> decStack = new Stack<>();
        int hi = 0;
        for (int i = nums.length - 1; i >= 0; i--) {
            while (decStack.size() > 0 && nums[i] > nums[decStack.peek()]) {
                hi = Math.max(hi, decStack.pop());
            }
            decStack.push(i);
        }
                
        return hi - lo > 0 ? hi - lo + 1: 0;
    }
}

Solution#

Solution