[leetcode]380. Insert Delete GetRandom O(1)

[leetcode]380. Insert Delete GetRandom O(1)

---

Analysis

出太阳啦~—— [每天刷题并不难0.0]

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.
   

Explanation:

主要是要保证删除的时间复杂度为O(1)，所以要先用一个hash表存储每个元素的索引，这样可以方便删除。

Implement

class RandomizedSet {
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(mmp.find(val) != mmp.end())
            return false;
        num.push_back(val);
        mmp[val] = num.size()-1;
        return true;
    }
    
    /** Removes a value from the set. Returns true if the set contained the specified element. */
    bool remove(int val) {
        if(mmp.find(val) == mmp.end())
            return false;
        int last = num.back();
        mmp[last] = mmp[val];
        int pos = mmp[val];
        num[pos] = last;
        num.pop_back();
        mmp.erase(val);
        return true;
    }
    
    /** Get a random element from the set. */
    int getRandom() {
        return num[rand() % num.size()];
    }
private:
    vector<int> num;
    unordered_map<int, int> mmp;
};

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