Shortest Unsorted Continuous Subarray

        sort(c.begin(), c.end());
        
        for(int i=0; i<nums.size(); i++){
            if(nums[i] != c[i] && !l_fixed){
                left = i;
                l_fixed = true;
            }
            
            if(nums[nums.size() - 1 - i] != c[nums.size() - 1 - i] && !r_fixed){
                right = nums.size() - 1 - i;
                
                r_fixed = true;
            }
        }
        if (left > right){
            return 0;
        }else{
            return right - left + 1;
        }
    }
};