正序(C)
int romanToInt(char* s)
{
int symbolValues[26];
symbolValues['I' - 'A'] = 1;
symbolValues['V' - 'A'] = 5;
symbolValues['X' - 'A'] = 10;
symbolValues['L' - 'A'] = 50;
symbolValues['C' - 'A'] = 100;
symbolValues['D' - 'A'] = 500;
symbolValues['M' - 'A'] = 1000;
int ans = 0; //记录总和
int n = strlen(s); //计算字符串长度
for (int i = 0; i < n; ++i)
{
int value = symbolValues[s[i] - 'A'];
if (i < n - 1 && value < symbolValues[s[i + 1] - 'A']) //n-1:避免越界
{
ans -= value;
}
else
{
ans += value;
}
}
return ans;
}