# **Convert roman number to decimal number **\n\njust like leetcode easy question \n\nhttps://leetcode.com/problems/roman-to-integer/\n\n\n**Very Simple Solution in C++**\n\nclass Solution {\n\npublic:\n   \nint romanToInt(string s) {\n\n    unordered_map<char,int> um={{\'I\',1},{\'V\',5},{\'X\',10},{\'L\',50},{\'C\',100},{\'D\',500},{\'M\',1000}};\n\n    int i=0,res=0,sub=0,pre=0;\n\n    while(i<s.length())\n\n    {\n\n        if(um[s[i+1]]>um[s[i]])\n        {\n\n            sub=um[s[i+1]]-um[s[i]];\n\n            res+=sub;\n            i=i+2;\n\n        }\n        else\n\n        {\n\n            res+=um[s[i]];\n            i++;\n        }\n    }\n    return res;\n}\n};

Convert roman number to decimal number \n\njust like leetcode easy question \n\nhttps://leetcode.com/problems/roman-to-integer/\n\n\nVery Simple Solution in C++