class Solution {
public int romanToInt(String s) {
char[] chars = s.toCharArray();
int result = 0;
for(int i=s.length()-1; i>=0; i--){
switch(chars[i]){
case'I': if(i==s.length()-1){
result = result+1;
}else{
if( chars[i+1] == 'V'||chars[i+1] == 'X' ){
result = result-1;
}else{
result = result+1;
}
}
break;
case'V': result = result+5;
break;
case'X': if(i==s.length()-1){
result += 10;
}else{
if( chars[i+1] == 'L'||chars[i+1] == 'C' ){
result -= 10;
}else{
result += 10;
}
}
break;
case'L': result += 50;
break;
case'C': if(i==s.length()-1){
result += 100;
}else{
if( chars[i+1] == 'D'||chars[i+1] == 'M' ){
result -= 100;
}else{
result += 100;
}
}
break;
case'D': result += 500;
break;
case'M': result += 1000;
break;
}
}
return result;
}
}