-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path448_FindAllNumbersDisappearedInArray.py
More file actions
67 lines (45 loc) · 1.93 KB
/
448_FindAllNumbersDisappearedInArray.py
File metadata and controls
67 lines (45 loc) · 1.93 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#-------------------------------------------------------------------------------
#
#-------------------------------------------------------------------------------
# By Will Shin
#
#-------------------------------------------------------------------------------
# LeetCode prompt
#-------------------------------------------------------------------------------
"""
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]
"""
#-------------------------------------------------------------------------------
# Approach
#-------------------------------------------------------------------------------
"""
The two pieces of information that we have :
1. the array length gives information about the range of numbers that we should be having?
2. if we find the number in the array, then it is not missing
3.
"""
#-------------------------------------------------------------------------------
# Solution
#-------------------------------------------------------------------------------
#-------------------------------------------------------------------------------
# Main Leetcode Input Driver
#-------------------------------------------------------------------------------
#-------------------------------------------------------------------------------
# Unit Test
#-------------------------------------------------------------------------------
import unittest
class TestSolution(unittest.TestCase):
def test_(self):
string = "1"
ans = 1
self.assertEqual(int(string), ans)
self.assertTrue(ans == 1)
self.assertFalse(ans == 2)
unittest.main()