LeetCode/581/main.py at master · lazzzis/LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
class Solution:
    def findUnsortedSubarray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        maxx, minn = min(nums), max(nums)
        pivot = -1
        for i, item in enumerate(nums):
            if item > maxx:
                maxx = item
            elif item < maxx:
                pivot = i
        end = pivot
        for i, item in enumerate(nums[::-1]):
            if item < minn:
                minn = item
            elif item > minn:
                pivot = len(nums) - 1 - i
        start = pivot
        if start < 0 or end < 0:
            return 0
        return end - start + 1


if __name__ == '__main__':
    import os

    if os.getenv('LZS'):  # local test
        s = Solution()
        assert s.findUnsortedSubarray([1, 3, 2]) == 2
        assert s.findUnsortedSubarray([2, 6, 4, 8, 10, 9, 15]) == 5
        assert s.findUnsortedSubarray([2, 6, 8, 10, 15]) == 0
        assert s.findUnsortedSubarray([2, 6, 8, 10, 15, 1]) == 6
        assert s.findUnsortedSubarray([2]) == 0
        assert s.findUnsortedSubarray([2, 6]) == 0
        assert s.findUnsortedSubarray([12, 6, 6, 6]) == 4
        assert s.findUnsortedSubarray([12, 6, 12, 6, 6]) == 5
        assert s.findUnsortedSubarray([12, 12, 6, 6, 12]) == 4