# Leetcode 380 - Insert delete getrandom O(1)

Note:

• Use an array and Map.
• Array is for generate a random using its length. Otherwise, we’ll have to iterate map and it will cost lots of time.
• Map store (val, index).
• Be careful when delete.
• Pop up the end first. If it is not the val, we need to swap it with the target in array.
• In this way, we can always keep the array filled.

Question:

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.

Example:

Code: