Leetcode 381. Insert Delete GetRandom O(1) - Duplicates allowed (数据结构设计好题)

  1. Insert Delete GetRandom O(1) - Duplicates allowed
    Hard

RandomizedCollection is a data structure that contains a collection of numbers, possibly duplicates (i.e., a multiset). It should support inserting and removing specific elements and also reporting a random element.

Implement the RandomizedCollection class:

RandomizedCollection() Initializes the empty RandomizedCollection object.

bool insert(int val) Inserts an item val into the multiset, even if the item is already present. Returns true if the item is not present, false otherwise.

bool remove(int val) Removes an item val from the multiset if present. Returns true if the item is present, false otherwise. Note that if val has multiple occurrences in the multiset, we only remove one of them.

int getRandom() Returns a random element from the current multiset of elements. The probability of each element being returned is linearly related to the number of the same values the multiset contains.

You must implement the functions of the class such that each function works on average O(1) time complexity.

Note: The test cases are generated such that getRandom will only be called if there is at least one item in the RandomizedCollection.

Example 1:

Input

"RandomizedCollection", "insert", "insert", "insert", "getRandom", "remove", "getRandom"

\[\], \[1\], \[1\], \[2\], \[\], \[1\], \[\]

Output

null, true, false, true, 2, true, 1

Explanation

RandomizedCollection randomizedCollection = new RandomizedCollection();

randomizedCollection.insert(1); // return true since the collection does not contain 1.

// Inserts 1 into the collection.

randomizedCollection.insert(1); // return false since the collection contains 1.

// Inserts another 1 into the collection. Collection now contains [1,1].

randomizedCollection.insert(2); // return true since the collection does not contain 2.

// Inserts 2 into the collection. Collection now contains [1,1,2].

randomizedCollection.getRandom(); // getRandom should:

// - return 1 with probability 2/3, or

// - return 2 with probability 1/3.

randomizedCollection.remove(1); // return true since the collection contains 1.

// Removes 1 from the collection. Collection now contains [1,2].

randomizedCollection.getRandom(); // getRandom should return 1 or 2, both equally likely.

Constraints:

-231 <= val <= 231 - 1

At most 2 * 105 calls in total will be made to insert, remove, and getRandom.

There will be at least one element in the data structure when getRandom is called.

解法1:注意题目的要求。每个操作(insert(), delete(), getRandom())都必须是O(1)时间复杂度。

getRandom()是O(1),那么必须用数组。

insert()和delete()是O(1),可以用doubly linked list+map,也可以直接就用unordered_set()。

cpp 复制代码
class RandomizedCollection {
public:
    RandomizedCollection() {
    }
    
    bool insert(int val) {
        bool res = false;
        if (val2freq.find(val) == val2freq.end()) res = true;
        val2freq[val]++;
        data.push_back(val);
        val2index[val].insert(data.size() - 1);
        return res;
    }
    
    bool remove(int val) {
        if (val2freq.find(val) == val2freq.end()) {
            return false;
        }
        int remove_elem_index = *val2index[val].begin();
        int last_elem = data.back();
        if (last_elem != val) {
            val2index[last_elem].erase(data.size() - 1);
            val2index[last_elem].insert(remove_elem_index);
            val2index[val].erase(remove_elem_index);
            data[remove_elem_index] = last_elem;
        }
        data.pop_back();
        val2freq[val]--;
        if (val2freq[val] == 0) {
            val2freq.erase(val);
            val2index.erase(val);
        }
        return true;
    }
    
    int getRandom() {
        return data[random() % data.size()];
    }
private:
    unordered_map<int, int> val2freq; //<value, freq>
    //unordered_map<int, vector<int>> val2index; //<value, indexes>
    unordered_map<int, unordered_set<int>> val2index; //<value, indexes>
    vector<int> data;    
};

/**
 * Your RandomizedCollection object will be instantiated and called as such:
 * RandomizedCollection* obj = new RandomizedCollection();
 * bool param_1 = obj->insert(val);
 * bool param_2 = obj->remove(val);
 * int param_3 = obj->getRandom();
 */
相关推荐
wuqingshun3141591 小时前
蓝桥杯 3. 压缩字符串
数据结构·c++·算法·职场和发展·蓝桥杯
杀神lwz5 小时前
数据结构和算法(八)--2-3查找树
数据结构
Tanecious.5 小时前
初阶数据结构--排序算法(全解析!!!)
数据结构·算法·排序算法
hu_yuchen7 小时前
C++:Lambda表达式
开发语言·c++·算法
烨然若神人~7 小时前
算法训练营第五天 | 454.四数相加II\ 383. 赎金信\15. 三数之和\ 18. 四数之和
算法
一只鱼^_7 小时前
牛客周赛 Round 91
数据结构·c++·算法·数学建模·面试·贪心算法·动态规划
啊阿狸不会拉杆7 小时前
人工智能数学基础(三):微积分初步
人工智能·python·算法·数学建模
2401_858286118 小时前
CC52.【C++ Cont】滑动窗口
开发语言·数据结构·c++·算法·leetcode·滑动窗口
mvufi9 小时前
day31 第八章 贪心算法 part05
算法·贪心算法
珊瑚里的鱼9 小时前
第一讲 | 算法复杂度
c语言·开发语言·数据结构·笔记·算法·visualstudio·visual studio