一.题目:
设计一个数据结构,有三个方法:插入、删除、随机选取一个数值。要求平均的时间复杂度是O(1).
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();
二.解题思路:
我们需要考虑题目要求,对于插入和删除和随机选值,时间复杂度要求是O(1),我们可以利用一个列表存储数据,再利用一个字典用来储存列表中的每个元素对应的列表的下标,这样的话我们就能做到对列表操作的时间复杂度为O(1)了.
代码如下:
class RandomizedSet(object):
def __init__(self):
"""
Initialize your data structure here.
"""
self.nums, self.pos = list(), dict()
def insert(self, val):
"""
Inserts a value to the set. Returns true if the set did not already contain the specified element.
:type val: int
:rtype: bool
"""
if val not in self.pos:
self.nums.append(val)
self.pos[val] = len(self.nums) - 1
return True
return False
def remove(self, val):
"""
Removes a value from the set. Returns true if the set contained the specified element.
:type val: int
:rtype: bool
"""
if val in self.pos:
idx, last = self.pos[val], self.nums[-1]
self.nums[idx] = last
self.pos[last] = idx
self.nums.pop()
del self.pos[val]
return True
return False
def getRandom(self):
"""
Get a random element from the set.
:rtype: int
"""
idx = random.randint(0, len(self.nums) - 1)
return self.nums[idx]
# 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()