LeetCode 381. Insert Delete GetRandom O(1) - Duplicates allowed

381. Insert Delete GetRandom O(1) - Duplicates allowed

Hard

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

Note: Duplicate elements are allowed.
insert(val): Inserts an item val to the collection.
remove(val): Removes an item val from the collection if present.
getRandom: Returns a random element from current collection of elements. The probability of each element being returned is linearly related to the number of same value the collection contains.
Example:

// Init an empty collection.
RandomizedCollection collection = new RandomizedCollection();

// Inserts 1 to the collection. Returns true as the collection did not contain 1.
collection.insert(1);

// Inserts another 1 to the collection. Returns false as the collection contained 1. Collection now contains [1,1].
collection.insert(1);

// Inserts 2 to the collection, returns true. Collection now contains [1,1,2].
collection.insert(2);

// getRandom should return 1 with the probability 2/3, and returns 2 with the probability 1/3.
collection.getRandom();

// Removes 1 from the collection, returns true. Collection now contains [1,2].
collection.remove(1);

// getRandom should return 1 and 2 both equally likely.
collection.getRandom();

题意

构造一个支持O(1)随机插入并判断是否存在的insert, O(1)随机删除并判断是否存在的remove, O(1)按同元素的个数为权重随机返回一个元素的getRandom的容器，支持重复的元素

思路

内部用一个名为map的HashMap(key为值，value为ArrayList，存储key在arr中的索引)和一个名为arr的ArrayList(元素为一个Pair类，Pair的两个属性分别是元素的值val和元素val在map.get(val)的数组中的索引)

代码

class RandomizedCollection {
    class Pair {
        int val, idx_in_map_lst;
        
        public Pair(int var, int idx) {
            val = var;
            idx_in_map_lst = idx;
        }
    }
    
    private ArrayList<Pair> arr = new ArrayList<>();
    private HashMap<Integer, ArrayList<Integer>> map = new HashMap<>();
    private Random rand = new Random();

    /** Initialize your data structure here. */
    public RandomizedCollection() {
        
    }
    
    /** Inserts a value to the collection. Returns true if the collection did not already contain the specified element. */
    public boolean insert(int val) {
        if (map.containsKey(val) && map.get(val).size() > 0) {
            arr.add(new Pair(val, map.get(val).size()));
            map.get(val).add(arr.size() - 1);
            return false;
        } else if (map.containsKey(val)) {
            arr.add(new Pair(val, 0));
            map.get(val).add(arr.size() - 1);
        } else {
            arr.add(new Pair(val, 0));
            ArrayList<Integer> tmp = new ArrayList<>();
            tmp.add(arr.size() - 1);
            map.put(val, tmp);
        }
        return true;
    }
    
    /** Removes a value from the collection. Returns true if the collection contained the specified element. */
    public boolean remove(int val) {
        if (!map.containsKey(val) || map.get(val).size() == 0) {
            return false;
        }
        int pos = map.get(val).get(map.get(val).size() - 1);
        Pair mov = arr.get(arr.size() - 1);
        map.get(mov.val).set(mov.idx_in_map_lst, pos);
        arr.set(pos, mov);
        map.get(val).remove(map.get(val).size() - 1);
        arr.remove(arr.size() - 1);
        return true;
    }
    
    /** Get a random element from the collection. */
    public int getRandom() {
        return arr.get(rand.nextInt(arr.size())).val;
    }
}

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