class Solution {
public:
int romanToInt(string s) {
int ret = 0;
for(int i=0; i<(int)s.length(); ++i)
{
if('M'==s[i])
ret += 1000;
else if('D'==s[i])
ret += 500;
else if('C'==s[i])
{
if(i+1<(int)s.length() && 'D'==s[i+1])
{
ret += 400;
++i;
}
else if(i+1<(int)s.length() && 'M'==s[i+1])
{
ret += 900;
++i;
}
else
ret += 100;
}
else if('L'==s[i])
ret += 50;
else if('X'==s[i])
{
if(i+1<(int)s.length() && 'L'==s[i+1])
{
ret += 40;
++i;
}
else if(i+1<(int)s.length() && 'C'==s[i+1])
{
ret += 90;
++i;
}
else
ret += 10;
}
else if('V'==s[i])
ret += 5;
else
{
if(i+1<(int)s.length() && 'V'==s[i+1])
{
ret += 4;
++i;
}
else if(i+1<(int)s.length() && 'X'==s[i+1])
{
ret += 9;
++i;
}
else
ret += 1;
}
}
return ret;
}
};