Note:
左边的比右边的小,就减去这个数,否则就加上
用hash表,字母给对应成数字,进行比较和加减的操作
代码如下:
class Solution {
public:
int romanToInt(string s) {
unordered_map<char, int> hash;
hash['I'] = 1, hash['V'] = 5,
hash['X'] = 10, hash['L'] = 50,
hash['C'] = 100, hash['D'] = 500,
hash['M'] = 1000;
int res = 0;
for(int i = 0; i < s.size(); i ++){
if(i + 1 < s.size() && hash[s[i]] < hash[s[i + 1]])
res -= hash[s[i]];
else
res += hash[s[i]];
}
return res;
}
};