-
Notifications
You must be signed in to change notification settings - Fork 26
/
381.InsertDeleteGetRandomO(1)-Duplicatesallowed.py
90 lines (73 loc) · 2.9 KB
/
381.InsertDeleteGetRandomO(1)-Duplicatesallowed.py
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
"""
Design a data structure that supports all following operations in average
O(1) time.
Note: Duplicate elements are allowed.
1. insert(val): Inserts an item val to the collection.
2. remove(val): Removes an item val from the collection if present.
3. getRandom: Returns a random element from current collection of
elements. The probability of each element being returned is linearly
related to the number of same value the collection contains.
Example:
// Init an empty collection.
RandomizedCollection collection = new RandomizedCollection();
// Inserts 1 to the collection. Returns true as the collection did not
// contain 1.
collection.insert(1);
// Inserts another 1 to the collection. Returns false as the collection
// contained 1. Collection now contains [1,1].
collection.insert(1);
// Inserts 2 to the collection, returns true. Collection now contains
// [1,1,2].
collection.insert(2);
// getRandom should return 1 with the probability 2/3, and returns 2
// with the probability 1/3.
collection.getRandom();
// Removes 1 from the collection, returns true. Collection now contains
// [1,2].
collection.remove(1);
// getRandom should return 1 and 2 both equally likely.
collection.getRandom();
"""
#Difficulty: Hard
#30 / 30 test cases passed.
#Runtime: 552 ms
#Memory Usage: 17.9 MB
#Runtime: 552 ms, faster than 7.10% of Python3 online submissions for Insert Delete GetRandom O(1) - Duplicates allowed.
#Memory Usage: 17.9 MB, less than 95.93% of Python3 online submissions for Insert Delete GetRandom O(1) - Duplicates allowed.
import random
class RandomizedCollection:
def __init__(self):
"""
Initialize your data structure here.
"""
self.collection = []
def insert(self, val: int) -> bool:
"""
Inserts a value to the collection. Returns true if the collection did
not already contain the specified element.
"""
if val not in self.collection:
self.collection.append(val)
return True
else:
self.collection.append(val)
return False
def remove(self, val: int) -> bool:
"""
Removes a value from the collection. Returns true if the collection
contained the specified element.
"""
if val in self.collection:
self.collection.remove(val)
return True
return False
def getRandom(self) -> int:
"""
Get a random element from the collection.
"""
return random.choice(self.collection)
# Your RandomizedCollection object will be instantiated and called as such:
# obj = RandomizedCollection()
# param_1 = obj.insert(val)
# param_2 = obj.remove(val)
# param_3 = obj.getRandom()