leetcode 380. O(1) 时间插入、删除和获取随机元素

程序员白特

已于 2022-05-19 16:55:18 修改

阅读量2.9k

点赞数

分类专栏：数据结构和算法文章标签： leetcode 算法职场和发展

于 2021-12-13 14:02:25 首次发布

本文链接：https://blog.csdn.net/weixin_45727472/article/details/121904009

版权

数据结构和算法专栏收录该内容

161 篇文章 4 订阅

订阅专栏

一、题目地址

https://leetcode-cn.com/problems/insert-delete-getrandom-o1/

二、具体代码

/**
 * Initialize your data structure here.
 */
var RandomizedSet = function() {
    this.map = new Map();
    this.nums = [];
};

/**
 * Inserts a value to the set. Returns true if the set did not already contain the specified element. 
 * @param {number} val
 * @return {boolean}
 */
RandomizedSet.prototype.insert = function(val) {
    if(this.map.has(val)) {
        return false;
    }
    this.nums.push(val);
    this.map.set(val, this.nums.length - 1);
    return true;
};

/**
 * Removes a value from the set. Returns true if the set contained the specified element. 
 * @param {number} val
 * @return {boolean}
 */
RandomizedSet.prototype.remove = function(val) {
    if(!this.map.has(val)) {
        return false;
    }
    let location = this.map.get(val);
    this.map.set(this.nums[this.nums.length - 1], location);
    this.map.delete(val);
    this.nums[location] = this.nums[this.nums.length - 1];
    this.nums.length--;
    return true;
};

/**
 * Get a random element from the set.
 * @return {number}
 */
RandomizedSet.prototype.getRandom = function() {
    let index = parseInt(Math.random() * this.nums.length);
    return this.nums[index];
};

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