LeetCode 581. 最短无序连续子数组(Shortest Unsorted Continuous Subarray)

581. 最短无序连续子数组
581. Shortest Unsorted Continuous Subarray

题目描述
给定一个整型数组，你需要寻找一个连续的子数组，如果对这个子数组进行升序排序，那么整个数组都会变为升序排序。

你找到的子数组应是最短的，请输出它的长度。

LeetCode581. Shortest Unsorted Continuous Subarray

示例 1:

说明:

Java 实现

import java.util.Arrays;

class Solution {
    public int findUnsortedSubarray(int[] nums) {
        int n = nums.length;
        int[] temp = nums.clone();
        Arrays.sort(temp);
        int start = 0;
        while (start < n && nums[start] == temp[start]) {
            start++;
        }
        int end = n - 1;
        while (end > start && nums[end] == temp[end]) {
            end--;
        }
        return end - start + 1;
    }
}

参考资料

• https://leetcode.com/problems/shortest-unsorted-continuous-subarray/discuss/103070/Java-Solution-Sort.
• https://leetcode.com/problems/shortest-unsorted-continuous-subarray/
• https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray/

LeetCode 581. 最短无序连续子数组(Shortest Unsorted Continuous Subarray)

原文：https://www.cnblogs.com/hglibin/p/10899592.html