Edit method MyHashMap.remove(key) for efficiency

Author: jsquared21

Exercise_27/Exercise_27_02/MyHashMap.class

@@ -159,19 +159,17 @@ 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; // One cycle of the arraylist
 		int j = 0;
-
-		while ((table.get(index) == null || 
-				  table.get(index).getKey() != key) && i != index) {
+		
+		while (table.get(index) != null) {
+			if (table.get(index).getKey() == key) {
+				table.remove(index);
+				size--; // Decrease size
+				break; // Remove just one entry that matches key
+			}
 			index += Math.pow(j++, 2);
 			index %= capacity;
 		}
-
-		if (table.get(index).getKey() == key) {
-			table.remove(index);
-			size--; // Decrease size
-		}
 	}
 
 	@Override /** Return the number of entries in this map */