Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
罗马数字左减右加
组合时大的数写在小的数前面,就是说 XIX 并不是XI,X的组合,而是X,IX 10+9=19(X>IX)
所以只需要判断当前数与后一个数的关系,如果小于后一个数直接用sum减去,如果大于就用sum加上
Source
public static int toNum(char x)
{
if(x == 'I') return 1;
if(x == 'V') return 5;
if(x == 'X') return 10;
if(x == 'L') return 50;
if(x == 'C') return 100;
if(x == 'D') return 500;
if(x == 'M') return 1000;
return 0;
}
public static int romanToInt(String s) {
int sum = 0,i;
for(i = 0; i < s.length() - 1; i++)
{
if( toNum(s.charAt(i)) < toNum(s.charAt(i+1)))
sum = sum - toNum(s.charAt(i));
else sum = sum + toNum(s.charAt(i));
}
sum = sum + toNum(s.charAt(i));
return sum;
}