class Solution {
public int findUnsortedSubarray(int[] nums) {//最短无序连续子数组
int len = nums.length;
int max = nums[0];
int min = nums[len-1];
int l = 0, r = -1;
for(int i=0;i<len;i++){
if(max>nums[i]){
r = i;
}else{
max = nums[i];
}
}
for(int i=len-1;i>=0;i--){
if(min<nums[i]){
l = i;
}else{
min = nums[i];
}
}
return r-l+1;
}
}