【力扣581. 最短无序连续子数组】巧妙法+单调栈（python3）

题目描述

https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray/

思路题解

巧妙法

https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray/solution/si-lu-qing-xi-ming-liao-kan-bu-dong-bu-cun-zai-de-/

class Solution:
    def findUnsortedSubarray(self, nums: List[int]) -> int:
        maxi,end,mini,begin,l=nums[0],-1,nums[-1],0,len(nums)
        for i in range(l):
            if nums[i]<maxi:
                end=i
            else:
                maxi=nums[i]
            if nums[l-i-1]>mini:
                begin=l-i-1
            else:
                mini=nums[l-i-1]
        return end-begin+1

单调栈

https://leetcode-cn.com/problems/shortest-unsorted-continuous-subarray/solution/zui-duan-wu-xu-lian-xu-zi-shu-zu-by-leetcode/