方法一:暴力求解,找逆序
class Solution {
public int findUnsortedSubarray(int[] nums) {
int minIndex = nums.length - 1;
int maxIndex = 0;
for (int i = 0; i < nums.length; i++) {
for (int j = i + 1; j < nums.length; j++) {
if (nums[i] > nums[j]) {
minIndex = Math.min(minIndex, i);
maxIndex = Math.max(maxIndex, j);
}
}
}
if (maxIndex - minIndex <= 0) return 0;
return maxIndex - minIndex + 1;
}
}