Design a data structure that supports all following operations in average O(1) time.
insert(val)
: Inserts an item val to the set if not already present.remove(val)
: Removes an item val from the set if present.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 1 is the only number in the set, getRandom always return 1. randomSet.getRandom();
这个题所用的数据结构很容易就能想到,想要插入或者删除的时候检查是否包含该元素,并且用到O(1)时间复杂度,就必须用到Hash表,想要读取的时候随机读取显然要用到数组或者list。
所以很简单就想到用一个hashmap,key是值,val是值在list中的索引。
关键的操作是删除的时候用到了替换的思想,保持其他元素索引不变。
public class RandomizedSet {
Map<Integer, Integer> map;
List<Integer> list;
public RandomizedSet() {
map=new HashMap<Integer, Integer>();
list=new ArrayList<Integer>();
}
/** Inserts a value to the set. Returns true if the set did not already contain the specified element. */
public boolean insert(int val) {
if(map.containsKey(val)){
return false;
}
list.add(val);
map.put(val, list.size()-1);
return true;
}
/** Removes a value from the set. Returns true if the set contained the specified element. */
public boolean remove(int val) {
if(!map.containsKey(val)){
return false;
}
int idx=map.remove(val);
if (idx < list.size() - 1) {
list.set(idx, list.get(list.size() - 1));
map.put(list.get(list.size() - 1), idx);
}
list.remove(list.size()-1);
return true;
}
public int getRandom() {
int a = (int) (Math.random()*list.size());
return list.get(a);
}
}