comefrom: <qiyuangong>581_Shortest_Unsorted_Continuous_Subarray_1.java
code: public int findUnsortedSubarray(int[] nums) {
          Stack < Integer > stack = new Stack < Integer > ();
          int l = nums.length, r = 0;
          for (int i = 0; i < nums.length; i++) {
              while (!stack.isEmpty() && nums[stack.peek()] > nums[i])
                  l = Math.min(l, stack.pop());
              stack.push(i);
          }
          stack.clear();
          for (int i = nums.length - 1; i >= 0; i--) {
              while (!stack.isEmpty() && nums[stack.peek()] < nums[i])
                  r = Math.max(r, stack.pop());
              stack.push(i);
          }
          return r - l > 0 ? r - l + 1 : 0;
      }
masked: public int sample_funcname ( int [ ] var_0 ) {
    Stack < Integer > var_3 = new Stack < Integer > ( ) ;
    int var_5 = var_0 . length , var_7 = 0 ;
    for ( int var_8 = 0 ;
    var_8 < var_0 . length ;
    var_8 ++ ) {
      while ( ! var_3 . isEmpty ( ) && var_0 [ var_3 . peek ( ) ] > var_0 [ var_8 ] ) var_5 = Math . min ( var_5 , var_3 . pop ( ) ) ;
      var_3 . push ( var_8 ) ;
    }
    var_3 . clear ( ) ;
    for ( int var_8 = var_0 . length - 1 ;
    var_8 >= 0 ;
    var_8 -- ) {
      while ( ! var_3 . isEmpty ( ) && var_0 [ var_3 . peek ( ) ] < var_0 [ var_8 ] ) var_7 = Math . max ( var_7 , var_3 . pop ( ) ) ;
      var_3 . push ( var_8 ) ;
    }
    return var_7 - var_5 > 0 ? var_7 - var_5 + 1 : 0 ;
  }
  