forked from kamyu104/LeetCode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathinsert-delete-getrandom-o1-duplicates-allowed.cpp
56 lines (43 loc) · 1.43 KB
/
insert-delete-getrandom-o1-duplicates-allowed.cpp
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
// Time: O(1)
// Space: O(n)
class RandomizedCollection {
public:
/** Initialize your data structure here. */
RandomizedCollection() {
}
/** Inserts a value to the collection. Returns true if the collection did not already contain the specified element. */
bool insert(int val) {
bool has = used_.count(val);
list_.emplace_back(val, used_[val].size());
used_[val].emplace_back(list_.size() - 1);
return !has;
}
/** Removes a value from the collection. Returns true if the collection contained the specified element. */
bool remove(int val) {
if (!used_.count(val)) {
return false;
}
used_[list_.back().first][list_.back().second] = used_[val].back();
swap(list_[used_[val].back()], list_.back());
used_[val].pop_back();
if (used_[val].empty()) {
used_.erase(val);
}
list_.pop_back();
return true;
}
/** Get a random element from the collection. */
int getRandom() {
return list_[rand() % list_.size()].first;
}
private:
vector<pair<int, int>> list_;
unordered_map<int, vector<int>> used_;
};
/**
* Your RandomizedCollection object will be instantiated and called as such:
* RandomizedCollection obj = new RandomizedCollection();
* bool param_1 = obj.insert(val);
* bool param_2 = obj.remove(val);
* int param_3 = obj.getRandom();
*/