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

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

参考资料：here。

class RandomizedCollection {
public:
	/** Initialize your data structure here. */
	RandomizedCollection() {

	}

	/** Inserts a value to the collection. Returns true if the collection did not already contain the specified element. */
	bool insert(int val) {
		v.push_back(val);
		m[val].insert(v.size() - 1);
		return m[val].size() == 1;
	}

	/** Removes a value from the collection. Returns true if the collection contained the specified element. */
	bool remove(int val) {
		if (m[val].size() == 0 || m.find(val) == m.end()) return false;
		if (val == v.back()) {
			v.pop_back();
			m[val].erase(v.size());
		}
		else {
			int idx = *m[val].begin();
			swap(v[idx], v.back());
			m[val].erase(idx);
			m[v[idx]].insert(idx);
			m[v[idx]].erase(v.size()-1);
			v.pop_back();
		}
		return true;
	}

	/** Get a random element from the collection. */
	int getRandom() {
		int r = rand() % v.size();
		return v[r];
	}
private:
	unordered_map<int, unordered_set<int>> m;
	vector<int> v;
};