added

Author: Mahin725

LeetCode/medium/706.Design HashMap Optimize.cpp

@@ -47,7 +47,7 @@ class MyHashMap {
     }
     int get(int key) { return getValueByHash(key); }
 
-    void remove(int key) { removemap(key); }
+    void remove(int key) { removemap(key);}
 };
 
 /**

LeetCode/medium/RomanToIngter.cpp

@@ -0,0 +1,24 @@
+class Solution {
+public:
+    int romanToInt(string s) {
+        unordered_map<char,int>romanValue;
+        romanValue['I']=1;
+        romanValue['V']=5;
+        romanValue['X']=10;
+        romanValue['L']=50;
+        romanValue['C']=100;
+        romanValue['D']=500;
+        romanValue['M']=1000;
+        int last = romanValue[s.back()];
+        int totalNum = last;
+        for(int i=s.size()-2; i>=0;i--){
+            if(romanValue[s[i]] < romanValue[s[i+1]]){
+                totalNum -= romanValue[s[i]];
+            }else{
+                totalNum+= romanValue[s[i]];
+            }
+        }
+        return totalNum;
+
+    }
+};