leetcode581+求最短未排序数组长度

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/u013554860/article/details/82317352

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

class Solution {
public:
    int findUnsortedSubarray(vector<int>& nums) {
        vector<int> cpnums(nums);
        sort(nums.begin(), nums.end());
        int len = nums.size();
        int i=0, j=len-1;
        while (nums[i]==cpnums[i]) {
            i++;
        }
        while (nums[j]==cpnums[j]) {
            j--;
        }
        return j-i+1<0? 0:j-i+1;
    }
};