leetcode 581

最新推荐文章于 2024-11-18 22:29:24 发布

garrulousabyss

最新推荐文章于 2024-11-18 22:29:24 发布

阅读量128

点赞数 3

文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/garrulousabyss/article/details/137445368

版权

class Solution(object):
    def findUnsortedSubarray(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        left, right = 0, -1
        new_nums = sorted(nums)
        for i in range(len(nums)):
            if nums[i] != new_nums[i]:
                left = i 
                break
        for i in range(len(nums)):
            if nums[i] != new_nums[i]:
                right = i 
        return right - left + 1