Shortest Unsorted Continuous Subarray Solutions in Python

Number 581

Difficulty Easy

Acceptance 31.1%

Other languages —

Solutions

Python solution by haoel/leetcode

def findUnsortedSubarray(self, nums):
    same = [a == b for a, b in zip(nums, sorted(nums))]
    return 0 if all(same) else len(nums) - same.index(False) - same[::-1].index(False)

def findUnsortedSubarray(self, nums):
    same = [a == b for a, b in zip(nums, sorted(nums))]
    return 0 if all(same) else len(nums) - same.index(False) - same[::-1].index(False)