@@ -0,0 +1,737 @@
+%22%22%22Leetcode 448. Find All Numbers Disappeared in an Array%0AEasy%0A%0AURL: https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/%0A%0AGiven an array of integers where 1 %E2%89%A4 a%5Bi%5D %E2%89%A4 n (n = size of array),%0Asome elements appear twice and others appear once.%0A%0AFind all the elements of %5B1, n%5D inclusive that do not appear in this array.%0A%0ACould you do it without extra space and in O(n) runtime?%0AYou may assume the returned list does not count as extra space.%0A%0AExample:%0AInput:%0A%5B4,3,2,7,8,2,3,1%5D%0AOutput:%0A%5B5,6%5D%0A%22%22%22%0A%0Aclass Solution(object):%0A    def findDisappearedNumbers(self, nums):%0A        %22%22%22%0A        :type nums: List%5Bint%5D%0A        :rtype: List%5Bint%5D%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc0448_find_all_numbers_disappeared_in_an_array.py