class Solution {
public int romanToInt(String s) {
int sum=0;
int i,k=0,j=0;
for( i=0;i<s.length()-1;i++)
{
switch(s.charAt(i))
{
case 'M':j=1000;break;
case 'D':j=500;break;
case 'C':j=100;break;
case 'L':j=50;break;
case 'X':j=10;break;
case 'V':j=5;break;
case 'I':j=1;break;
}
switch(s.charAt(i+1))
{
case 'M':k=1000;break;
case 'D':k=500;break;
case 'C':k=100;break;
case 'L':k=50;break;
case 'X':k=10;break;
case 'V':k=5;break;
case 'I':k=1;break;
}
if(j>=k)
sum+=j;
else
{
sum+=(k-j);
i++;
}
}
if(i==s.length()-1)
{
switch(s.charAt(i))
{
case 'M':j=1000;break;
case 'D':j=500;break;
case 'C':j=100;break;
case 'L':j=50;break;
case 'X':j=10;break;
case 'V':j=5;break;
case 'I':j=1;break;
}
sum+=j;
}
return sum;
}
}