Java Solution (Beats 99.20%) Using HashMap and ArrayList with Explanation

  • 0

    The List is used to store numbers and serve the getRandom() method. The Map contains the mapping between the value and its index in the ArrayList. The Map helps to check whether a value is already inserted or not. The main trick is when you remove a value. ArrayList's remove method is O(n) if you remove from random location. To overcome that, we swap the values between (randomIndex, lastIndex) and always remove the entry from the end of the list. After the swap, you need to update the new index of the swapped value (which was previously at the end of the list) in the map.

    public class RandomizedSet {
        HashMap<Integer, Integer> valToInd;
        List<Integer> list;
        int ind = 0;
        /** Initialize your data structure here. */
        public RandomizedSet() {
            valToInd = new HashMap<>();
            list = new ArrayList<>();
        /** Inserts a value to the set. Returns true if the set did not already contain the specified element. */
        public boolean insert(int val) {
            if(valToInd.containsKey(val)) return false;
            return true;
        /** Removes a value from the set. Returns true if the set contained the specified element. */
        public boolean remove(int val) {
            int ind = valToInd.getOrDefault(val,-1);
            if(ind == -1) return false;
            int swappedWith = list.get(ind);
            return true;
        /** Get a random element from the set. */
        public int getRandom() {
            int max = list.size();
            int min = 0;
            int ind = (int)(Math.random() * (max - min) + min);
            return list.get(ind);

Log in to reply

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.