leetCode581

把一直到了最后都没有老实排队的揪出来

class Solution {
public:
    int findUnsortedSubarray(vector<int>& nums) {
        int Max = nums[0];
        int Min = nums[nums.size()-1];
        int high = 0;
        int low = nums.size()-1;
        for(int i = 0;i<nums.size();i++)
        {
            Max = max(nums[i],Max);
            // cout<<nums[nums.size()-1-i]<<endl;
            Min = min(nums[nums.size()-1-i],Min);
            if(nums[i]<Max) high = i;
            if(nums[nums.size()-1-i]>Min) low = nums.size()-1-i;
        }
        return high>low ? high - low + 1 : 0;
    }
};