leetcode 581. 最短无序连续子数组 排序nlogn vs O(n)解法

排序O(nlogn)
之后找到第一个交换和最后交换的位置

class Solution {
public:
    int findUnsortedSubarray(vector<int>& nums) {
        vector<int> nn(nums);
        sort(nn.begin(),nn.end());
        int s = 0;
        int e = nums.size()-1;
        while( s<nums.size() && nums[s] == nn[s] ){
            s++;
        }
        while(e>=0 && nums[e] == nn[e] ){
            e--;
        }
        if( e-s+1<0 ){
            return 0;
        }else{
            return e-s+1;
        }
    }
};

https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray/comments/

class Solution {
public:
    int findUnsortedSubarray(vector<int>& nums) {
        if( nums.size()==1 ){
            return 0;
        }
        int max1 = INT_MIN;
        int min1 = INT_MAX;
        int low = nums.size()-1;
        int high = 0;
        for( int i=0;i<nums.size(); i++){
            max1 = max( max1,nums[i] );
            min1 = min( min1, nums[ nums.size()-1-i ] );
            if( nums[i] < max1 ){
                high = i;
            }
            if( nums[ nums.size()-1-i ]>min1 ){
                low = nums.size()-1-i;
            }
        }
        return high-low+1>0?high-low+1:0;
    }
};