Find All Numbers Disappeared in an Array

题目

Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.

Find all the elements of [1, n] inclusive that do not appear in this array.

Could you do it without extra space and in O(n) runtime? You may assume the returned list does not count as extra space.

Example:

Input:
[4,3,2,7,8,2,3,1]

Output:
[5,6]

总结

一开始怎么都想不到O（n）的算法，也是看了别人的思路才茅塞顿开。
假设数组长度为n，那么数组中只包含1 - n的数字。可对应下标0 - n-1。可以用一个临时数组的状态来记录已经出现过的值，把出现的数字x对应的下标x-1置-1，最后值不为-1对应的下标+1就是没有出现的数
代码：

class Solution:
    def findDisappearedNumbers(self, nums):
        """
        :type nums: List[int]
        :rtype: List[int]
        """
        mark = nums[:]
        for n in nums:
            mark[n - 1] = -1
            
        r = []
        for i in range(len(mark)):
            if mark[i] != -1:
                r.append(i + 1)
        return r

上述算法使用了一个临时数组，那怎么去掉临时数组呢，把-1改为 -(原值)，这样就保留了原本的信息，只要处理时注意符号即可

代码：

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

要善用数组下标简化数字出现问题！！