LeetCode 581. Shortest Unsorted Continuous Subarray

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) {
        vector<int> tmp(nums);
        sort(tmp.begin(), tmp.end());
        int i = 0, j = nums.size()-1;
        while(tmp[i] == nums[i]) i++;
        while(tmp[j] == nums[j]) j--;
        return j-i+1 < 0 ? 0 : j-i+1;
        
    }
};