Steve Choi

비전공자 출신 개발자 블로그.

Day012 - 380. Insert Delete GetRandom O(1)

업데이트:

380. Insert Delete GetRandom O(1)Permalink

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 1:

Input
["RandomizedSet", "insert", "remove", "insert", "getRandom", "remove", "insert", "getRandom"]
[[], [1], [2], [2], [], [1], [2], []]
Output
[null, true, false, true, 2, true, false, 2]

Explanation
RandomizedSet randomizedSet = new RandomizedSet();
randomizedSet.insert(1); // Inserts 1 to the set. Returns true as 1 was inserted successfully.
randomizedSet.remove(2); // Returns false as 2 does not exist in the set.
randomizedSet.insert(2); // Inserts 2 to the set, returns true. Set now contains [1,2].
randomizedSet.getRandom(); // getRandom() should return either 1 or 2 randomly.
randomizedSet.remove(1); // Removes 1 from the set, returns true. Set now contains [2].
randomizedSet.insert(2); // 2 was already in the set, so return false.
randomizedSet.getRandom(); // Since 2 is the only number in the set, getRandom() will always return 2.

Constraints:

  • -231 <= val <= 231 - 1
  • At most 2 * 105 calls will be made to insert, remove, and getRandom.
  • There will be at least one element in the data structure when getRandom is called.


내 풀이Permalink

import random

class RandomizedSet:
    def __init__(self):
        self.val_list = []
        self.idx_dict = {}

    def insert(self, val: int) -> bool:
        if val not in self.idx_dict:
            self.val_list.append(val) # val_list에 val을 append
            self.idx_dict[val] = len(self.val_list) - 1 # index 정보를 value로 저장
            return True
        else:
            return False

    def remove(self, val: int) -> bool:
        if val in self.idx_dict:
            remove_idx = self.idx_dict[val]
            last_val = self.val_list[-1]
            
            self.val_list[remove_idx] = last_val
            self.idx_dict[last_val] = remove_idx

            self.val_list.pop()
            del self.idx_dict[val]
    
            return True
        else:
            return False

    def getRandom(self) -> int:
        random_idx = random.randrange(0, len(self.val_list))
        return self.val_list[random_idx]

이

# Time Complexity : O(N)



카테고리:

업데이트:

댓글남기기

참고