Runtime: 105 ms (Top 72.29%) | Memory: 61.60 MB (Top 55.94%)

Author: AnasImloul

scripts/algorithms/D/Design HashMap/Design HashMap.cpp

@@ -1,30 +1,62 @@
+// Runtime: 105 ms (Top 72.29%) | Memory: 61.60 MB (Top 55.94%)
+
 class MyHashMap {
+	vector<vector<pair<int, int>>> map;
+	const int size = 10000;
 public:
-    vector<pair<int,int>> mpp;
-    MyHashMap() {
-        
-    }
-    
-    void put(int key, int value) {
-        for(int i=0;i<mpp.size();i++){
-            if(mpp[i].first==key){
-                mpp[i].second=value;
-                break;
+	/** Initialize your data structure here. */
+	MyHashMap() {
+		map.resize(size);
+	}
+
+	/** value will always be non-negative. */
+	void put(int key, int value) {
+		int index = key % size;
+        vector<pair<int, int>> &row = map[index];
+        for(auto iter = row.begin(); iter != row.end(); iter++)
+        {
+            if(iter->first == key)
+            {
+                iter->second = value;
+                return;
             }
         }
-        mpp.push_back({key,value});
-    }
-    
-    int get(int key) {
-        for(int i=0;i<mpp.size();i++){
-            if(mpp[i].first==key && mpp[i].second!=INT_MIN)return mpp[i].second;
-        }
-        return -1;
-    }
-    
-    void remove(int key) {
-        for(int i=0;i<mpp.size();i++){
-            if(mpp[i].first==key)mpp[i].second=INT_MIN;
-        }
-    }
+		row.push_back(make_pair(key, value));
+	}
+
+	/** Returns the value to which the specified key is mapped, or -1 if this map contains no mapping for the key */
+	int get(int key) {
+		int index = key % size;
+        vector<pair<int, int>> &row = map[index];
+		for (auto iter = row.begin(); iter != row.end(); iter++)
+		{
+			if (iter->first == key)
+			{
+				return iter->second;
+			}
+		}
+		return -1;
+	}
+
+	/** Removes the mapping of the specified value key if this map contains a mapping for the key */
+	void remove(int key) {
+		int index = key % size;
+        vector<pair<int, int>> &row = map[index];
+		for (auto iter = row.begin(); iter != row.end(); iter++)
+		{
+			if (iter->first == key)
+			{
+				row.erase(iter);
+                return;
+			}
+		}
+	}
 };
+
+/**
+ * Your MyHashMap object will be instantiated and called as such:
+ * MyHashMap* obj = new MyHashMap();
+ * obj->put(key,value);
+ * int param_2 = obj->get(key);
+ * obj->remove(key);
+ */