448. Find All Numbers Disappeared in an Array -- set

448. Find All Numbers Disappeared in an Array

Total Accepted: 40636Total Submissions: 77545Difficulty: EasyContributors:yuhaowang001Given 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]

解1：
利用set求解结合的差

class Solution(object):    def findDisappearedNumbers(self, nums):        """        :type nums: List[int]        :rtype: List[int]        """        return list(set(range(1,len(nums) +1)) - set(nums))