https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray/solution/zui-duan-wu-xu-lian-xu-zi-shu-zu-by-leet-yhlf/

法一：排序

来源：力扣
image.png

  1.    // 法一： 排序
  2.     public int findUnsortedSubarray(int[] nums) {
  3.         int[] numsSorted = new int[nums.length];
  4.         System.arraycopy(nums, 0, numsSorted, 0, nums.length);
  5.         Arrays.sort(numsSorted);
  6.         int left = 0;
  7.         int right = nums.length - 1;
  9.         while (nums[left] == numsSorted[left]) {
  10.             left++;
  11.             // 要是数组本来就是全部有序的，那么就会有这种情况
  12.             if (left > right) {
  13.                 return 0;
  14.             }
  15.         }
  16.         while (nums[right] == numsSorted[right]) {
  17.             right--;
  18.         }
  19.         return right - left + 1;
  20.     }