380 Insert Delete GetRandom O(1)

1 题目

Design a data structure that supports all following operations in average O(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 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 2 is the only number in the set, getRandom always return 2.
randomSet.getRandom();

2 标准解

2.1 分析

要求构建一个数据结构，实现插入、删除和随机返回容器中的一项，且复杂度均为O()。

用一个向量saver<int>来保存数值，用一个哈希表pos<int,int>记录每个值的位置。当插入时，在向量末尾插入新元素，并用哈希表记录改元素的位置。当删除时，用向量末尾的元素覆盖待删除元素，即saver[pos[del_val]] = saver.back(), pos[saver.back()] = pos[del_val]，然后saver.pop_back(),pos.erase(del_val)即可，所有操作均为常数复杂度。

2.2 代码

#include <cstdlib>
#include <ctime>
class RandomizedSet {
private:
    unordered_map <int,int> pos;
    vector<int> saver;
public:
    /** Initialize your data structure here. */
    RandomizedSet() {
        
    }
    
    /** Inserts a value to the set. Returns true if the set did not already contain the specified element. */
    bool insert(int val) {
        if(pos.count(val)) return false;
        saver.push_back(val);
        pos[val] = saver.size()-1;
        return true;
    }
    
    /** Removes a value from the set. Returns true if the set contained the specified element. */
    bool remove(int val) {
        if(!pos.count(val)) return false;
        int last_val = saver.back();
        saver[pos[val]] = last_val;
        pos[last_val] = pos[val];
        saver.pop_back();
        pos.erase(val);
        return true;
    }
    
    /** Get a random element from the set. */
    int getRandom() {
        return saver[rand()%saver.size()];
    }
};