Edit method MyHashMap.get(key) for efficiency

Author: jsquared21

Exercise_27/Exercise_27_01/MyHashMap.class

@@ -88,19 +88,15 @@ public java.util.Set<MyMap.Entry<K,V>> entrySet() {
 	@Override /** Return the value that matches the specified key */
 	public V get(K key) {
 		int index = hash(key.hashCode());
-		int i = index - 1; // One cycle of the arraylist
 
-		// While index is empty or a collision occurs check the next index
-		while (index != i && (table.get(index) == null || 
-				 table.get(index).getKey() != key)) {
+		while(table.get(index) != null) {
+			if (table.get(index).getKey() == key) {
+					return table.get(index).getValue();
+			}
 			index++;
 			index %= capacity;
 		}
 
-		if (table.get(index).getKey() == key) {
-				return table.get(index).getValue();
-		}
-
 		return null;
 	}