class RandomizedSet {
public:
vector<int> arr;
unordered_map<int,int> mp;
/** 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(mp.find(val)!=mp.end())
return false;
arr.push_back(val);
mp[val]=arr.size()-1;
return true;
}
/** Removes a value from the set. Returns true if the set contained the specified element. */
bool remove(int val) {
if(mp.find(val)==mp.end())
return false;
arr[mp[val]]=arr[arr.size()-1]; //将要删除的数移动到数组末尾
mp[arr[arr.size()-1]]=mp[val];
arr.pop_back();
mp.erase(mp.find(val));
return true;
}
/** Get a random element from the set. */
int getRandom() {
return arr[rand()%arr.size()];
}
};
/**
* 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();
*/
380.常数时间插入、删除和获取随机元素
最新推荐文章于 2020-10-31 09:12:50 发布