题目
解题
解题一:排序
//
var findUnsortedSubarray = function(nums) {
if (isSorted(nums)) return 0;
const numsSorted = [...nums].sort((a, b) => a - b);
let left = 0;
while (nums[left] === numsSorted[left]) left++;
let right = nums.length - 1;
while (nums[right] == numsSorted[right]) right--;
return right - left + 1;
};
const isSorted = (nums) => {
for (let i = 1; i < nums.length; i++) {
if (nums[i] < nums[i - 1]) {
return false;
}
}
return true;
};
解题二:一次遍历
从右到左找第一个 n u m s [ j ] < n u m s [ j − 1 ] nums[j] < nums[j - 1] nums[j]<nums[j−1] 的 j j j,如果 j = 0 j = 0 j=0,代表整个数组都是升序排列的,返回 0;否则,从左到右找第一个 n u m s [ i ] > n u m s [ i + 1 ] nums[i] > nums[i + 1] nums[i]>nums[i+1] 的 i i i。
nums = [2,6,4,8,17,9,15] => i = 1, j = 5
但还有一个问题那就是:max(numsA) <= min(numsB),max(numsB) <= min(numsC)。所以算出 min(numsB) 和 max(numsB),再向左向右去比较。
// javascript
var findUnsortedSubarray = function(nums) {
const n = nums.length;
let i = 0, j = n - 1;
let minLen = 0;
while (i < j && nums[j] >= nums[j - 1]) j--;
if (j === 0) return 0;
while (i < j && nums[i] <= nums[i + 1]) i++;
minLen = j - i + 1;
const numsB = nums.slice(i, j + 1);
const maxVal = Math.max(...numsB);
const minVal = Math.min(...numsB);
for (let k = i - 1; k >= 0 && nums[k] > minVal; k--) minLen++;
for (let k = j + 1; k < n && nums[k] < maxVal; k++) minLen++;
return minLen;
};
// javascript
var findUnsortedSubarray = function(nums) {
const n = nums.length;
let maxn = -Number.MAX_VALUE, right = -1;
let minn = Number.MAX_VALUE, left = -1;
for (let i = 0; i < n; i++) {
if (maxn > nums[i]) {
right = i;
} else {
maxn = nums[i];
}
if (minn < nums[n - i - 1]) {
left = n - i - 1;
} else {
minn = nums[n - i - 1];
}
}
return right === -1 ? 0 : right - left + 1;
};