FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/C++/insert-delete-getrandom-o1.cpp at master · Addoile/LeetCode-Solutions · GitHub
Addoile
LeetCode-Solutions
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode-Solutions
/
C++
/
insert-delete-getrandom-o1.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
55 lines (42 loc) · 1.21 KB
Breadcrumbs
LeetCode-Solutions
/
C++
/
insert-delete-getrandom-o1.cpp
Copy path
File metadata and controls
55 lines (42 loc) · 1.21 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
//
Time: O(1)
//
Space: O(n)
class
RandomizedSet
{
public:
/*
* 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
(used_.
count
(val)) {
return
false
;
}
set_.
emplace_back
(val);
used_[val] = set_.
size
() -
1
;
return
true
;
}
/*
* Removes a value from the set. Returns true if the set contained the specified element.
*/
bool
remove
(
int
val) {
if
(!used_.
count
(val)) {
return
false
;
}
used_[set_.
back
()] = used_[val];
swap
(set_[used_[val]], set_.
back
());
used_.
erase
(val);
set_.
pop_back
();
return
true
;
}
/*
* Get a random element from the set.
*/
int
getRandom
() {
return
set_[
rand
() % set_.
size
()];
}
private:
vector<
int
> set_;
unordered_map<
int
,
int
> used_;
};
/*
*
* 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();
*/
Back
|
FazBrowse Home
|
New Git URL