380. Insert Delete GetRandom O(1)

---

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();

Analyse:

​ ArrayList添加元素的时候是O（1）的，但是删除由于底层是封装了一个数组，所以时间复杂度是O（n），我们可以采取map记录下元素的位置，当要删除时将要删除的元素与数组中最后一个元素交换位置，做到删除时间复杂度为O（n）。随机数用Random随机一个索引就可。

Answer:

class RandomizedSet {

    /** Initialize your data structure here. */
    private List<Integer> nums;
    private Map<Integer,Integer> loc;
    Random random;

    public RandomizedSet() {

        nums = new ArrayList<>();
        loc = new HashMap<>();
        random = 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(loc.containsKey(val)) return false;
        loc.put(val,nums.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(!loc.containsKey(val)) return false;
        int pos = loc.get(val);
        if(pos!=nums.size()-1){
            int temp = nums.get(nums.size()-1);
            nums.set(nums.size()-1,val);
            nums.set(pos,temp);
            loc.put(val,nums.size()-1);
            loc.put(temp,pos);
        }
        nums.remove(nums.size()-1);
        loc.remove(val);
        return true;
    }

    /** Get a random element from the set. */
    public int getRandom() {
        int index = random.nextInt(nums.size());
        return nums.get(index);
    }
}

/**
 * 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();
 */