Shortest Unsorted Continuous Subarray

Given an integer array, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too.

You need to find the shortest such subarray and output its length.

Example 1:

Input: [2, 6, 4, 8, 10, 9, 15]
Output: 5
Explanation: You need to sort [6, 4, 8, 10, 9] in ascending order to make the whole array sorted in ascending order.

 

Note:

1. Then length of the input array is in range [1, 10,000].
2. The input array may contain duplicates, so ascending order here means <=.

这个点比较迟了，也没有多想，就写了一个傻瓜式的解答，先贴上来：

class Solution {
public:
    int findUnsortedSubarray(vector<int>& nums) {

        auto tmp = nums;
        
        int n = nums.size();
        
        sort(nums.begin(), nums.end());
        
        int i = 0;
        for(; i < n; ++i)
        {
            if(tmp[i] != nums[i])
                break;
        }
        int j = n - 1;
        for(; j >= 0; --j)
        {
            if(tmp[j] != nums[j])
                break;
        }
        return j - i + 1 > 0 ? j - i + 1 : 0;//注意不需重排的
    }
};

明天来看看大神的解答 :）