-
Notifications
You must be signed in to change notification settings - Fork 23
/
Copy path0380-insert-delete-getrandom-o1.js
52 lines (47 loc) · 1.45 KB
/
0380-insert-delete-getrandom-o1.js
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
/**
* 380. Insert Delete GetRandom O(1)
* https://leetcode.com/problems/insert-delete-getrandom-o1/
* Difficulty: Medium
*
* Implement the RandomizedSet class:
* - RandomizedSet() Initializes the RandomizedSet object.
* - bool insert(int val) Inserts an item val into the set if not present. Returns true if the
* item was not present, false otherwise.
* - bool remove(int val) Removes an item val from the set if present. Returns true if the item
* was present, false otherwise.
* - int getRandom() Returns a random element from the current set of elements (it's guaranteed
* that at least one element exists when this method is called). Each element must have the
* same probability of being returned.
*
* You must implement the functions of the class such that each function works in average O(1)
* time complexity.
*/
var RandomizedSet = function() {
this.set = new Set();
};
/**
* @param {number} val
* @return {boolean}
*/
RandomizedSet.prototype.insert = function(val) {
const hasValue = this.set.has(val);
this.set.add(val);
return !hasValue;
};
/**
* @param {number} val
* @return {boolean}
*/
RandomizedSet.prototype.remove = function(val) {
const hasValue = this.set.has(val);
this.set.delete(val);
return hasValue;
};
/**
* @return {number}
*/
RandomizedSet.prototype.getRandom = function() {
const item = Array.from(this.set);
const randomIndex = Math.floor(Math.random() * item.length);
return item[randomIndex];
};