# [leetcode] 13. Roman to Integer

112人阅读 评论(0)

Given a roman numeral, convert it to an integer.

Input is guaranteed to be within the range from 1 to 3999.

any of the letters representing numbers in the Roman numerical system: I = 1, V = 5, X = 10, L = 50, C = 100, D = 500, M = 1,000. In this system, a letter placed after another of greater value adds (thus XVI or xvi is 16), whereas a letter placed before another of greater value subtracts (thus XC or xc is 90).

Solution 1:

Idea: use switch flow. If current val is smaller than next val, minus current val. (36ms for 3999 cases)

class Solution {
public:
int romanToInt(string s) {
int num_digit = s.size();
int ret = 0;
int cur = 0, aft = 0;
for(int i = 0; i<num_digit-1; i++){
cur = characterToInt(s[i]);
aft = characterToInt(s[i+1]);
if (cur < aft)
ret -= cur;
else
ret += cur;
}
ret += characterToInt(s[num_digit-1]);
return ret;

}
int characterToInt(char c){
int val;
switch (c){
case 'I':
val= 1;
break;
case 'V':
val= 5;
break;
case 'X':
val= 10;
break;
case 'L':
val= 50;
break;
case 'C':
val= 100;
break;
case 'D':
val= 500;
break;
case 'M':
val= 1000;
}
return val;
}
};

Solution 2

Idea: use hash table (72ms for 3999 cases)

class Solution {
public:
int romanToInt(string s) {
unordered_map<char,int> hs;
hs['M'] = 1000;
hs['D'] = 500;
hs['C'] = 100;
hs['L'] = 50;
hs['X'] = 10;
hs['V'] = 5;
hs['I'] = 1;

int ret= 0;
for(int i=0; i<s.size()-1;i++){
int val = hs[s[i]];
int aft = hs[s[i+1]];
if(val<aft)
ret-= val;
else
ret+= val;
}
ret+= hs[s[s.size()-1]];
return ret;

}
};

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：10150次
• 积分：636
• 等级：
• 排名：千里之外
• 原创：31篇
• 转载：150篇
• 译文：0篇
• 评论：0条
文章分类