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.

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:
    def findUnsortedSubarray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if nums is None or len(nums)<2:
            return 0
        l = []
        sort_nums=sorted(nums)
        for i in range(len(nums)):
            if nums[i]!=sort_nums[i]:
              l.append(i)
        if l==[]:
            return 0
        return l[-1]-l[0]+1

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