LeetCode 380. Insert Delete GetRandom O(1)

Design a data structure that supports all following operations in average O(1) time.

 

1. insert(val): Inserts an item val to the set if not already present.
2. remove(val): Removes an item val from the set if present.
3. getRandom: Returns a random element from current set of elements. Each element must have the same probability of being returned.

 

Example:

// Init an empty set.
RandomizedSet randomSet = new RandomizedSet();

// Inserts 1 to the set. Returns true as 1 was inserted successfully.
randomSet.insert(1);

// Returns false as 2 does not exist in the set.
randomSet.remove(2);

// Inserts 2 to the set, returns true. Set now contains [1,2].
randomSet.insert(2);

// getRandom should return either 1 or 2 randomly.
randomSet.getRandom();

// Removes 1 from the set, returns true. Set now contains [2].
randomSet.remove(1);

// 2 was already in the set, so return false.
randomSet.insert(2);

// Since 2 is the only number in the set, getRandom always return 2.
randomSet.getRandom();

--------------------------------------------------------------------

What a pity for bugs:

import random
class RandomizedSet:

    def __init__(self):
        """
        Initialize your data structure here.
        """
        self.items = []
        self.d = {}
        self.idx = -1

    def insert(self, val: int) -> bool:
        """
        Inserts a value to the set. Returns true if the set did not already contain the specified element.
        """
        if (val not in self.d):
            self.idx += 1
            self.items.append(val) #bug2：没想到
            self.d[val] = self.idx
            return True
        return False

    def remove(self, val: int) -> bool:
        """
        Removes a value from the set. Returns true if the set contained the specified element.
        """
        if (val in self.d): #bug1：想到了但是还写错了
            if (val == self.items[self.idx]):
                self.d.pop(val)
            else:                
                idx = self.d[val]
                self.d.pop(val)
                self.d[self.items[self.idx]] = idx 
                self.items[idx],self.items[self.idx]=self.items[self.idx],self.items[idx]
            self.idx -= 1
            self.items.pop()
            return True
        return False

    def getRandom(self) -> int:
        """
        Get a random element from the set.
        """
        i = random.randint(0,self.idx)
        return self.items[i]
        


# Your RandomizedSet object will be instantiated and called as such:
# obj = RandomizedSet()
# param_1 = obj.insert(val)
# param_2 = obj.remove(val)
# param_3 = obj.getRandom()