Description
Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
Solution
和12. Integer to Roman相反可婶，給定一個羅馬數(shù)字俏竞，求對應的阿拉伯數(shù)值遮怜，注意9陷虎、4的情況
int romanToInt(string s) {
int ret = 0;
map<char, int> myMap = {{'M', 1000}, {'D', 500}, {'C', 100}, {'L', 50}, {'X', 10}, {'V', 5}, {'I', 1}};
for (int i = 0; i< s.length(); ++i) {
if (i < s.length() - 1 && myMap[s[i]] < myMap[s[i + 1]]) {
ret += myMap[s[i + 1]] - myMap[s[i]]; //出現(xiàn)9郁稍、4的case
i++;
} else {
ret += myMap[s[i]];
}
}
return ret;
}
