Edit method MyHashMap.remove(key) for efficiency

Author: jsquared21

Exercise_27/Exercise_27_03/MyHashMap.class

@@ -166,16 +166,18 @@ public void remove(K key) {
 		int index = hash1;
 		int j = 0;
 
-		while (table.get(index) == null) {
+		// Remove the first entry that matched 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
+			}
+
 			// Secondary hash: (k + j * h'(key)) % N
 			index = hash1 + j++ * hash2(hash1); 
 			index %= capacity;
 		}
-
-		if (table.get(index).getKey() == key) {
-			table.remove(index);
-			size--; // Decrease size
-		}
 	}
 
 	@Override /** Return the number of entries in this map */