最短子数组 python



# -*- coding:utf-8 -*-

class Subsequence:
    def shortestSubsequence(self, A, n):
        # write code here
        max=A[0]
        min=A[n-1]
        right=0
        left=n-1
        for i in range(1,n):
            if max<=A[i]:
                max=A[i]
            elif A[i]<max:
                right=i
        for j in range(n-1,-1,-1):
            if min>=A[j]:
                min=A[j]
            elif A[j]>min:
                left=j
        if right==0 and left==n-1:
            return 0
        else:
            return right-left+1