581. 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:
Then length of the input array is in range [1, 10,000].
The input array may contain duplicates, so ascending order here means <=.

解题思路：

1. 要求排列最小的连续子数组即可得到升序序列，那么不需要排列的子数组一定是在最左和最右，且原本就是升序并且中间需要排列的数组最小值大于左边最大值，最大值小于右边最小值。

2. 两次for循环，一次找到左边连续升序最大子数组和右边部分的最小值。一次找到右边连续降序最大子数组和左边部分最大值。

3. 将最小值和左边部分比较，最大值和右边部分比较。

解题代码：

class Solution {
public:
    int findUnsortedSubarray(vector<int>& nums) {
        int l = -2, r = -2, min = nums[0], max = nums[0];
        for (int i = 1; i < nums.size(); ++i) {
            if (l == -2 && nums[i] < nums[i - 1]) {
                l = i - 2;
                min = nums[i];
            }
            if (l != -2) {
                if (nums[i] < min)
                    min = nums[i];
            }
        }
        for (int i = nums.size() - 1; i > 0; --i) {
            if (r == -2 && nums[i] < nums[i - 1]) {
                r = i + 1;
                if (max < nums[i-1])
                    max = nums[i - 1];
            }
            if (r != -2) {
                if (nums[i] > max)
                    max = nums[i];
            }
        }
        if (l == -2 && r == -2)
            return 0;
        for (int i = 0; i <= l; ++i) {
            if (nums[i] > min) {
                l = i - 1;
                break;
            }
        }
        for (int i = nums.size() - 1; i >= r; --i) {
            if (nums[i] < max) {
                r = i + 1;
                break;
            }
        }
        return r - l - 1;
    }
};