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:

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(object):
    def findUnsortedSubarray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        nums2 = sorted(nums)
        if nums == nums2:
            return 0
        i = 0
        while nums[i] == nums2[i]:
            i += 1
        j = -1
        while nums[j] == nums2[j]:
            j -= 1
        l = len(nums[i:j])+1
        return l

581. Shortest Unsorted Continuous Subarray

原文：https://www.cnblogs.com/jeroen/p/9153210.html