202020713——第五百八十一题 最短无序连续子数组

class Solution {
    public int findUnsortedSubarray(int[] nums) {
        int[] newnums = nums.clone();
        Arrays.sort(newnums);
        int start = nums.length,end = 0;
        for(int i = 0 ;i<nums.length;++i){
            if(nums[i] != newnums[i]){
                start = Math.min(start,i);
                end = Math.max(end,i);
            }
        }
        return end-start>=0? end-start+1:0;
    }
}