380. Insert Delete GetRandom O(1)
来源:互联网 发布:设计队徽用什么软件 编辑:程序博客网 时间:2024/06/05 19:31
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();
public class RandomizedSet {HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();ArrayList<Integer> al = new ArrayList<Integer>();Random rand = new Random(); /** Initialize your data structure here. */ public RandomizedSet() { } /** Inserts a value to the set. Returns true if the set did not already contain the specified element. */ public boolean insert(int val) { if(map.containsKey(val)) return false; map.put(val, map.size()); al.add(val); return true; } /** Removes a value from the set. Returns true if the set contained the specified element. */ public boolean remove(int val) { if(!map.containsKey(val)) return false; int loc = map.get(val); if(loc != al.size()-1){ int last = al.get(al.size()-1); al.set(loc, last); map.put(last, loc); } map.remove(val); al.remove(al.size()-1); return true; } /** Get a random element from the set. */ public int getRandom() { return al.get(rand.nextInt(al.size())); }}/** * Your RandomizedSet object will be instantiated and called as such: * RandomizedSet obj = new RandomizedSet(); * boolean param_1 = obj.insert(val); * boolean param_2 = obj.remove(val); * int param_3 = obj.getRandom(); */
- [leetcode] 380. Insert Delete GetRandom O(1)
- leetcode 380.Insert Delete GetRandom O(1)
- 380. Insert Delete GetRandom O(1)
- 380. Insert Delete GetRandom O(1)
- 380. Insert Delete GetRandom O(1)
- 380. Insert Delete GetRandom O(1)
- [LeetCode]380. Insert Delete GetRandom O(1)
- 380. Insert Delete GetRandom O(1)
- 380. Insert Delete GetRandom O(1)
- 380. Insert Delete GetRandom O(1)
- 380. Insert Delete GetRandom O(1)
- 380. Insert Delete GetRandom O(1)
- 【Leetcode】380. Insert Delete GetRandom O(1)
- LeetCode 380. Insert Delete GetRandom O(1)
- 380. Insert Delete GetRandom O(1)
- 380. Insert Delete GetRandom O(1)
- 380. Insert Delete GetRandom O(1)
- 【leetcode】380. Insert Delete GetRandom O(1)
- leetcode之sort-list
- RecyclerView的几种布局方式
- C# 10进制转换2进制,并且保留两位数的方法
- struts2的java.lang.NoSuchMethodException异常处理
- exception = android.view.InflateException: Binary XML file line #21: 部分手机正常,部分手机不正常
- 380. Insert Delete GetRandom O(1)
- node中使用os模块获取操作系统信息
- SpannableString与SpannableStringBuilder
- 关于MySQL的1067错误解决方法
- 仿《雷霆战机》飞行射击手游开发--新手引导
- nios ii 及 quartus ii错误记录
- Linux常用指令
- java项目打成可在命令行用命令运行的jar包
- 关于结构体struct的sizeof计算问题