Edit method MyHashMap.put(key, value) for efficiency

Author: jsquared21

Exercise_27/Exercise_27_03/MyHashMap.class

@@ -96,7 +96,7 @@ public V get(K key) {
 			if (table.get(index).getKey().equals(key)) {
 				return table.get(index).getValue();
 			}
-			
+
 			// Secondary hash: (k + j * h'(key)) % N
 			index = hash1 + j++ * hash2(hash1); 
 			index %= capacity;
@@ -129,8 +129,8 @@ public V put(K key, V value) {
 		int j = 0;
 
 		while (table.get(index) != null) {
-			// Add a new entry (key, value)
-			if (table.get(index).getKey() == key) {
+			// The key is already in the map
+			if (table.get(index).getKey().equals(key)) {
 				Entry<K, V> entry = table.get(index);
 				V oldValue = entry.getValue();
 				// Replace old value with new value