LeetCode-581. 最短无序连续子数组

LeetCode-581. 最短无序连续子数组

class Solution {
    public int findUnsortedSubarray(int[] nums) {
        int len=nums.length;
        int[] numCopy = nums.clone();
        Arrays.sort(numCopy);
        int l=0,r=len-1;
        while(l<len && numCopy[l]==nums[l]){
            l++;
        }
        if(l==len){
            return 0;
        }
        while(r>=0 && numCopy[r]==nums[r]){
            r--;
        }
        return r-l+1;
        
    }
}