LeetCode OJ 13. Roman to Integer
Description
Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
解题思路
罗马数字转换为整数:我们把1,10,100,1000,5,500,500和对应的罗马数字做映射。罗马数字的特点是:如果后一个的字母表示的数字比它自身表示的数字大,那说明这两个数字之间是做减法的,得到的结果加上当且结果;否则直接加上当前结果。以这样的方式遍历完这个罗马数字的字符串,即可得到最终结果。
代码
class Solution {
public:
int romanToInt(string s) {
int roman[256] = {0};
int num = 0;
roman['I'] = 1;roman['X'] = 10;roman['C'] = 100;roman['M'] = 1000;roman['V'] = 5;
roman['L'] = 50;roman['D'] = 500;
int i = 0;
while(i < s.length()){
if(roman[s[i]] < roman[s[i+1]]){
num -= roman[s[i]];
}
else
num += roman[s[i]];
i ++;
}
return num;
}
};