LeetCode #380 - Insert Delete GetRandom O(1)

最新推荐文章于 2023-06-18 08:11:36 发布

LawFile

最新推荐文章于 2023-06-18 08:11:36 发布

阅读量159

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/LawFile/article/details/81224762

版权

LeetCode 专栏收录该内容

625 篇文章 1 订阅

订阅专栏

题目描述：

Design a data structure that supports all following operations in average O(1) time.

insert(val): Inserts an item val to the set if not already present.
remove(val): Removes an item val from the set if present.
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();

设计一个数据结构，能够满足插入、删除、任取一个元素这几个操作都是O(1)的时间复杂度。底层的数据结构采用的一个vector，插入操作自然是O(1)的，任取一个元素的时间复杂度也为O(1)，但是删除操作是O(n)的，所以再用一个哈希表辅助，每次插入都在哈希表中做下标记，每次删除的时候把最后一个元素交换到这个元素的位置上，并删除最后一个元素。

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