[4]380. Insert Delete GetRandom O(1)(Java)

注：此博客不再更新，所有最新文章将发表在个人独立博客limengting.site。分享技术，记录生活，欢迎大家关注

Design a data structure that supports all following operations in average O(1) time.

1、insert(val): Inserts an item val to the set if not already present.
2、remove(val): Removes an item val from the set if present.
3、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();

Consider the two situations with no duplicates and with duplicates

// no duplicates
class RandomizedSet {
    List<Integer> nums;
    Map<Integer, Integer> map;
    Random rand = new Random();
    /** Initialize your data structure here. */
    public RandomizedSet() {
        // 使用同步的ArrayList和HashMap来记录数组和索引
        nums = new ArrayList<>();
        map = new HashMap<>(); // map<val, index>
    }
    
    /** 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());
        nums.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 index = map.get(val);
        
        /* val不是最后一个插入的元素，则用最后一个元素覆盖val
           覆盖后nums[index] == val 变成了 nums[index] == lastone，
		        nums[nums.size() - 1] == lastone（最后一个元素本来的样子）
           覆盖后map中含有<val, index>（val元素本来的样子），增加了<lastone, index>键值对
        */
        if (index != map.size() - 1) { // 不能只使用ArrayList，因为知道val无法得知index。
            int lastone = nums.get(nums.size() - 1); // 不能只使用HashMap，因为知道index无法得知val。
            nums.set(index, lastone); // nums[index] = lastone
            map.put(lastone, index);
        }
        map.remove(val);
        nums.remove(nums.size() - 1);
        return true;
    }
    
    /** Get a random element from the set. */
    public int getRandom() {
        return nums.get(rand.nextInt(nums.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();
 */

The follow-up: allowing duplications.
For example, after insert(1), insert(1), insert(2), getRandom() should have 2/3 chance return 1 and 1/3 chance return 2.
Then, remove(1), 1 and 2 should have an equal chance of being selected by getRandom().

The idea is to add a set to the hashMap to remember all the locations of a duplicated number.

// with duplicates
public class RandomizedSet {
	    ArrayList<Integer> nums;
	    HashMap<Integer, Set<Integer>> map;
	    java.util.Random rand = new java.util.Random();
	    /** Initialize your data structure here. */
	    public RandomizedSet() {
	        nums = new ArrayList<Integer>();
	        map = new HashMap<Integer, Set<Integer>>();
	    }
	    
	    /** 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)) map.put(val, new HashSet<Integer>()); 
	        locs.get(val).add(nums.size());        
	        nums.add(val);
	        return !map.containsKey(val) ;
	    }
	    
	    /** 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;
	        // 	iterator()返回Iterator<E>，<iterator类型变量> .next()返回<E>，即迭代的下一个元素
	        int index = map.get(val).iterator().next();
                map.get(val).remove(index);
	        if (index < nums.size() - 1) {
	            int lastone = nums.get(nums.size() - 1 );
	            nums.set(index, lastone);
	            map.get(lastone).remove(nums.size() - 1);
	            map.get(lastone).add(index);
	        }
	        nums.remove(nums.size() - 1);
	        if (map.get(val).isEmpty()) map.remove(val);
	        return true;
	    }
	    
	    /** Get a random element from the set. */
	    public int getRandom() {
	        return nums.get( rand.nextInt(nums.size()) );
	    }
	}