-
Notifications
You must be signed in to change notification settings - Fork 0
/
Insert Delete GetRandom O(1) - Medium
41 lines (37 loc) · 1.13 KB
/
Insert Delete GetRandom O(1) - Medium
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
class RandomizedSet {
public:
vector<int>v;
unordered_map<int,int>mp;
/** Initialize your data structure here. */
RandomizedSet() { }
/** Inserts a value to the set. Returns true if the set did not already contain the specified element. */
bool insert(int val) {
if(mp.find(val)!=mp.end())
return false;
v.push_back(val);
mp[val]=v.size()-1;
return true;
}
/** Removes a value from the set. Returns true if the set contained the specified element. */
bool remove(int val) {
if(mp.find(val)==mp.end())
return false;
auto it=mp.find(val);
v[it->second] = v.back();
v.pop_back();
mp[v[it->second]] = it->second;
mp.erase(val);
return true;
}
/** Get a random element from the set. */
int getRandom() {
return v[rand()%v.size()];
}
};
/**
* Your RandomizedSet object will be instantiated and called as such:
* RandomizedSet* obj = new RandomizedSet();
* bool param_1 = obj->insert(val);
* bool param_2 = obj->remove(val);
* int param_3 = obj->getRandom();
*/