【数组】Leetcode编程题解：380. Insert Delete GetRandom O(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.

样例：

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

这道题目应该是上一道题目381的难度降低版本，主要是这次题目规定每种数字只能出现一次，所以可以不使用优先队列，其他的和381差不多，都是使用哈希列表实现，以满足题目要求的时间复杂度。

提交代码如下：

#include<vector>
#include<map>
#include<stack>
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(!nums[val].empty())
        return false;
        else {
        	nums[val].push(sun.size());
        	sun.push_back(val);
        	return true;
		}
    }
    
    /** Removes a value from the set. Returns true if the set contained the specified element. */
    bool remove(int val) {
        if(nums[val].empty())
        return false;
        else {
        	int temp = nums[val].top();
        	nums[val].pop();
        	if(temp != sun.size() - 1) {
        	sun[temp] = sun.back();
        	nums[sun.back()].pop();
        	nums[sun.back()].push(temp);
			}
        	sun.pop_back();
        	return true;
		}
    }
    
    /** Get a random element from the set. */
    int getRandom() {
        return sun[rand() % sun.size()];
    }
    private:
    	vector<int> sun;
    	map<int, stack<int>> nums;
};

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