python leetcode 448. Find All Numbers Disappeared in an Array

考察对数组的操作 与442. Find All Duplicates in an Array 有异曲同工之妙

class Solution:
    def findDisappearedNumbers(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        for i in range(len(nums)):
            
            index=abs(nums[i])-1
            nums[index] = - abs(nums[index]) 
        res=[]
        for i in range(len(nums)):
            if nums[i] > 0:
                res.append(i+1)
        return res