Insert Delete GetRandom O(1)

Design a data structure that supports all following operations in averageO(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 thesame 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();

思路：random就需要线性的结构，但是要delete O(1), hashmap可以支持access value O(1)，delete O(1)，那么就是把最后的一个元素跟delete的元素换一下，然后更新hashmap的里面的index值，那就可以实现O(1)。所以最终解法就是: HashMap + ArrayList. Delete需要特殊处理一下。更新hashmap和arraylist，这里需要熟知hashmap的remove和arraylist的remove。应该记得先update一下list，然后 update hashmap，这样写，思路清晰；

class RandomizedSet {
    private HashMap<Integer, Integer> hashmap;
    private List<Integer> list;
    private Random random;
    public RandomizedSet() {
        this.hashmap = new HashMap<>();
        this.list = new ArrayList<>();
        this.random = new Random();
    }
    
    public boolean insert(int val) {
        if(hashmap.containsKey(val)) {
            return false;
        } else {
            hashmap.put(val, list.size());
            list.add(val);
            return true;
        }
    }
    
    public boolean remove(int val) {
        if(!hashmap.containsKey(val)) {
            return false;
        } else {
            int lastIndex = list.size() - 1;
            int lastVal = list.get(lastIndex);
            
            int index = hashmap.get(val);
            list.set(index, lastVal);
            hashmap.put(lastVal, index);
            hashmap.remove(val);
            list.remove(lastIndex);
            return true;
        }
    }
    
    public int getRandom() {
        int index = random.nextInt(list.size());
        return list.get(index);
    }
}

/**
 * Your RandomizedSet object will be instantiated and called as such:
 * RandomizedSet obj = new RandomizedSet();
 * boolean param_1 = obj.insert(val);
 * boolean param_2 = obj.remove(val);
 * int param_3 = obj.getRandom();
 */