lintcode: Insert Delete GetRandom O(1)

504 篇文章 0 订阅
66 篇文章 0 订阅

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.


class RandomizedSet {
    
private:
    vector<int> nums;
    unordered_map<int, int> m;
    
public:
    RandomizedSet() {
        // do initialize if necessary
    }
    
    // Inserts a value to the set
    // Returns true if the set did not already contain the specified element or false
    bool insert(int val) {
        // Write your code here
        if (m.count(val))
            return false;
            
        nums.push_back(val);
        m[val] = nums.size()-1;
        return true;
    }
    
    // Removes a value from the set
    // Return true if the set contained the specified element or false
    bool remove(int val) {
        // Write your code here
        
        if (!m.count(val))
            return false;
        
        m[nums[nums.size()-1]] = m[val];
        nums[m[val]] = nums[nums.size()-1];
        
        nums.pop_back();
        m.erase(val);
        return true;
    }
    
    // Get a random element from the set
    int getRandom() {
        // Write your code here
        
        return nums[rand() % nums.size()];
    }
};

/**
 * Your RandomizedSet object will be instantiated and called as such:
 * RandomizedSet obj = new RandomizedSet();
 * bool param = obj.insert(val);
 * bool param = obj.remove(val);
 * int param = obj.getRandom();
 */



  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值