Edit method MyHashMap.remove(key) for efficiency

Author: jsquared21

Exercise_27/Exercise_27_04/MyHashMap.class

@@ -110,7 +110,7 @@ public java.util.Set<V> getAll(K key) {
 			if (table.get(index).getKey().equals(key)) {
 				set.add(table.get(index).getValue());
 			}
-			
+
 			index++;
 			index %= capacity;
 		}
@@ -162,18 +162,18 @@ public V put(K key, V value) {
 	@Override /** Remove the entry for the specified key */
 	public void remove(K key) {
 		int index = hash(key.hashCode());
-		int i = index - 1;
 
-		while (i != index && (table.get(index) == null || 
-				 table.get(index).getKey() != key)) {
+		// Remove the first entry that matches the key
+		while (table.get(index) != null) {
+			if (table.get(index).getKey().equals(key)) {
+				table.remove(index);
+				size--; // Decrease size
+				break; // Remove just one entry that matches the key
+			}
+			
 			index++;
 			index %= capacity;
 		}
-
-		if (table.get(index).getKey() == key) {
-			table.remove(index);
-			size--; // Decrease size
-		}
 	}
 
 	@Override /** Return the number of entries in this map */