设计有setAll功能的哈希表

【题目】哈希表常见的三个操作是put、get和containKey，而且这三个操作的时间复杂度为O(1).现在想加一个setAll功能，就是把所有记录的value都设成统一的值。请设计并实现这种有setAll功能的哈希表，并且，get、put、containsKey、setAll四个操作的时间复杂度都是O(1).

public class SetAllHashMap {
	public static class MyValue<V> {
		private V value;
		private int time;

		public MyValue(V value, int time) {
			this.value = value;
			this.time = time;
		}

		public V getValue() {
			return this.value;
		}

		public int getTime() {
			return this.time;
		}
	}

	public static class MyHashMap<K, V> {
		private HashMap<K, MyValue<V>> map;
		private int time;
		private MyValue<V> setAll;

		public MyHashMap() {
			this.map = new HashMap<K, MyValue<V>>();
			this.time = 0;
			this.setAll = new MyValue<V>(null, -1);
		}

		public boolean containsKey(K key) {
			return this.map.containsKey(key);
		}

		public void put(K key, V value) {
			this.map.put(key, new MyValue<V>(value, time++));
		}

		public void setAll(V value) {
			this.setAll = new MyValue<V>(value, time++);
		}

		public V get(K key) {
			if (this.containsKey(key)) {
				if (this.map.get(key).getTime() > this.setAll.getTime()) {
					return this.map.get(key).getValue();
				} else {
					return this.setAll.getValue();
				}
			} else {
				return null;
			}
		}
	}
}