Edit method MyHashMap.get(key) for efficiency

Author: jsquared21

Exercise_27/Exercise_27_01/MyHashMap.class

@@ -90,7 +90,7 @@ public V get(K key) {
 		int index = hash(key.hashCode());
 
 		while(table.get(index) != null) {
-			if (table.get(index).getKey() == key) {
+			if (table.get(index).getKey().equals(key)) {
 					return table.get(index).getValue();
 			}
 			index++;
@@ -120,7 +120,7 @@ public java.util.Set<K> keySet() {
 	@Override /** Add an entry (key, value) into the map */
 	public V put(K key, V value) {
 		int index = hash(key.hashCode());
-		
+
 		while (table.get(index) != null) {
 			// The key is already in the map
 			if (table.get(index).getKey().equals(key)) {