-
Notifications
You must be signed in to change notification settings - Fork 0
/
Roman to integer.cpp
76 lines (71 loc) · 2.98 KB
/
Roman to integer.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
class Solution {
public:
int romanToInt(string s) {
int num;
bool proceed;
int slen;
slen = s.length();
if ((slen >= 1) && (slen <= 15)){
for(int i=0; i<slen; i++){
switch(s[i]){
case 'I' : proceed = true; break;
case 'V' : proceed = true; break;
case 'X' : proceed = true; break;
case 'L' : proceed = true; break;
case 'C' : proceed = true; break;
case 'D' : proceed = true; break;
case 'M' : proceed = true; break;
default : proceed = false;
}
}
}
if(proceed){
num = 0;
for(int i=0; i<slen; i++){
switch(s[i]){
case 'I' : num = num + 1;
if ((i+1)<slen){
switch(s[i+1]){
case 'V' : num = num + 4 - 1;
i++;
break;
case 'X' : num = num + 9 - 1;
i++;
break;
}
}
break;
case 'X' : num = num + 10;
if ((i+1)<slen){
switch(s[i+1]){
case 'L' : num = num + 40 - 10;
i++;
break;
case 'C' : num = num + 90 - 10;
i++;
break;
}
}
break;
case 'C' : num = num + 100;
if ((i+1)<slen){
switch(s[i+1]){
case 'D' : num = num + 400 - 100;
i++;
break;
case 'M' : num = num + 900 - 100;
i++;
break;
}
}
break;
case 'V' : num = num + 5; break;
case 'L' : num = num + 50; break;
case 'D' : num = num + 500; break;
case 'M' : num = num + 1000; break;
}
}
}
return num;
}
};