接外包,有相关需求的可以联系我:Telegram | Email

Insert Delete GetRandom O(1)

该文章创建(更新)于03/7/2022,请注意文章的时效性!

Implement the RandomizedSet class:

  • RandomizedSet() Initializes the RandomizedSet object.
  • bool insert(int val) Inserts an item val into the set if not present. Returns true if the item was not present, false otherwise.
  • bool remove(int val) Removes an item val from the set if present. Returns true if the item was present, false otherwise.
  • int getRandom() Returns a random element from the current set of elements (it's guaranteed that at least one element exists when this method is called). Each element must have the same probability of being returned.

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

Solution

List Origin Using.

Code

  • submit code
import random

class RandomizedSet:

    def __init__(self):
        self.res = []

    def insert(self, val: int) -> bool:
        if val not in self.res:
            self.res.append(val)
            return True
        else:
            return False

    def remove(self, val: int) -> bool:
        if val in self.res:
            self.res.remove(val)
            return True
        else:
            return False

    def getRandom(self) -> int:
        return random.choice(self.res)


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


👇 Share | 分享 👇


要不赞赏一下?

微信
支付宝
PayPal
Bitcoin

版权声明 | Copyright

除非特别说明,本博客所有作品均采用知识共享署名-非商业性使用-禁止演绎 4.0 国际许可协议进行许可。转载请注明转自-
https://www.emperinter.info/2022/03/07/insert-delete-getrandom-o1/


要不聊聊?

我相信你准备留下的内容是经过思考的!【勾选防爬虫,未勾选无法留言】

*

*



微信公众号

👉 NewsLetter ❤️ 邮箱订阅 👈

优惠码


阿里云国际版20美元
Vultr10美元
搬瓦工 | Bandwagon应该有折扣吧?
域名 | namesiloemperinter(1美元)