题目
代码部分(20ms 37.53%)
class Solution {
public int findUnsortedSubarray(int[] nums) {
int len = nums.length;
if(len == 1) return 0;
int res = 0;
int first, last;
first = last = -1;
int[] sort = new int[len];
for(int i = 0; i < len; i++){
sort[i] = nums[i];
}
Arrays.sort(sort);
for(int i = 0; i < len; i++){
if(sort[i] != nums[i]){
if(first != -1){
last = i;
}else{
first = i;
}
}
}
if(last == first) return 0;
return last - first + 1;
}
}