Edit method MyHashMap.get(key) for efficiency

Author: jsquared21

Exercise_27/Exercise_27_02/MyHashMap.class

@@ -89,18 +89,16 @@ 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
 		int j = 0;
-
-		while (index != i && (table.get(index) == null || 
-				 table.get(index).getKey() != key)) {
+		
+		while (table.get(index) != null) {
+			if (table.get(index).getKey().equals(key)) {
+				return table.get(index).getValue();
+			}
 			index += Math.pow(j++, 2);
 			index %= capacity;
 		}
 
-		if (table.get(index).getKey() == key)
-			return table.get(index).getValue();
-
 		return null;
 	}