class Solution {
public:
int romanToInt(string s) {
int flag = 1, num = 0;
map<char,int> m;
m['I'] = 1;
m['V'] = 5;
m['X'] = 10;
m['L'] = 50;
m['C'] = 100;
m['D'] = 500;
m['M'] = 1000;
int len = s.length();
for( int i = 0; i < len; i++ )
{
if( m[s[i]] < m[s[i+1]] )
num -= m[s[i]];
else
num += m[s[i]];
}
return num;
}
};
Roman to Integer
最新推荐文章于 2022-03-18 20:30:12 发布