• Insert Delete GetRandom O(1)


    2018-07-15 18:36:29

    问题描述:

    问题求解:

        private ArrayList<Integer> ls;
        private HashMap<Integer, Integer> map;
        private Random rand;
    
        /** Initialize your data structure here. */
        public RandomizedSet() {
            ls = new ArrayList<>();
            map = new HashMap<>();
            rand = new Random();
        }
    
        /** 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;
            ls.add(val);
            map.put(val, ls.size() - 1);
            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 idx = map.get(val);
            if (idx != ls.size() - 1) {
                int temp = ls.get(ls.size() - 1);
                ls.set(idx, temp);
                map.put(temp, idx);
            }
            map.remove(val);
            ls.remove(ls.size() - 1);
            return true;
        }
    
        /** Get a random element from the set. */
        public int getRandom() {
            return ls.get(rand.nextInt(ls.size()));
        }
    
  • 相关阅读:
    状压DP
    数位dp
    浅谈网络最大流
    Luogu p2456 二进制方程
    dp基础√
    双联通分量与二分图
    是时候再写一篇新的博客了
    神仙网络最大流
    状态压缩dp相关
    图论 test solution
  • 原文地址:https://www.cnblogs.com/hyserendipity/p/9314470.html
Copyright © 2020-2023  润新知