• ```java class Solution { public int findUnsortedSubarray(int[] nums) {
      1.   int n = nums.length;
      2.   int maxn = Integer.MIN_VALUE, right = -1;
      3.   int minn = Integer.MAX_VALUE, left = -1;
      4.   for (int i = 0; i < n; i++) {
      5.       if (maxn > nums[i]) {
      6.           right = i;
      7.       } else {
      8.           maxn = nums[i];
      9.       }
      10.       if (minn < nums[n - i - 1]) {
      11.           left = n - i - 1;
      12.       } else {
      13.           minn = nums[n - i - 1];
      14.       }
      15.   }
      16.   return right == -1 ? 0 : right - left + 1;
      } }

    ```