【python-leetcode442-循环排序】数组中重复的数据

class Solution:
    def findDuplicates(self, nums: List[int]) -> List[int]:
        l,r=0,len(nums)-1
        while l<=r:
            if nums[l] != nums[nums[l]-1]:
                nums[nums[l]-1],nums[l]=nums[l],nums[nums[l]-1]
            else:
                l+=1
        res=[]
        for i in range(len(nums)):
            if i+1 != nums[i]:
                res.append(nums[i])
        return res