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

Problem Decription:

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

Note: Duplicate elements are allowed.

 

1. insert(val): Inserts an item val to the collection.
2. remove(val): Removes an item val from the collection if present.
3. 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();

Analysis:

本题的思路也是使用List模拟insert，remove的操作。代码如下：

Code:

class RandomizedCollection {

    List<Integer> temp;
    /** Initialize your data structure here. */
    public RandomizedCollection() {
        temp = new ArrayList<>();
    }
    
    /** Inserts a value to the collection. Returns true if the collection did not already contain the specified element. */
    public boolean insert(int val) {
        for(int i = 0; i < temp.size(); i++) {
            if(val == temp.get(i)) {
                temp.add(val);
                return false;
            }
        }
        temp.add(val);
        return true;
    }
    
    /** Removes a value from the collection. Returns true if the collection contained the specified element. */
    public boolean remove(int val) {
        for(int i = 0; i < temp.size(); i++) {
            if(val == temp.get(i)) {
                temp.remove(i);
                return true;
            }
        }
        return false;
    }
    
    /** Get a random element from the collection. */
    public int getRandom() {
        Random random = new Random();
        int cnt = random.nextInt(temp.size()) % temp.size();
        return temp.get(cnt);
    }
}

/**
 * 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();
 */