이상한 swap

https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/submissions/

class Solution: 
    def findDisappearedNumbers(self, nums: List[int]) -> List[int]: 
        for i in range(len(nums)): 
            c = 0 
            while nums[i] != nums[nums[i]-1] and nums[i] != i+1 : 
                if c > 4: break 
                print(nums, nums[i], nums[nums[i]-1])
                # right
                nums[i], nums[nums[i]-1] = nums[nums[i]-1], nums[i] 
                # wrong
                #nums[nums[i]-1], nums[i] = nums[i], nums[nums[i]-1] 
                c+=1