-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path13. Roman to Integer link
64 lines (58 loc) · 2.02 KB
/
13. Roman to Integer link
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
//https://leetcode.com/problems/roman-to-integer/
class Solution {
public:
int romanToInt(string s) {
int ans=0,i = 0;
while(i < s.size()){
if(s[i] == 'C' && s[i+1]=='D'){ans+=400;i++;i++;}else
if(s[i] == 'C' && s[i+1]=='M'){ans+=900;i++;i++;}else
if(s[i] == 'X' && s[i+1]=='L'){ans+=40;i++;i++;}else
if(s[i] == 'X' && s[i+1]=='C'){ans+=90;i++;i++;}else
if(s[i] == 'I' && s[i+1]=='V'){ans+=4;i++;i++;}else
if(s[i] == 'I' && s[i+1]=='X'){ans+=9;i++;i++;}else
if(s[i] == 'I'){ans+=1;i++;}else
if(s[i] == 'V'){ans+=5;i++;}else
if(s[i] == 'X'){ans+=10;i++;}else
if(s[i] == 'L'){ans+=50;i++;}else
if(s[i] == 'C'){ans+=100;i++;}else
if(s[i] == 'D'){ans+=500;i++;}else
if(s[i] == 'M'){ans+=1000;i++;}
}
return(ans);
}
};
string stringToString(string input) {
assert(input.length() >= 2);
string result;
for (int i = 1; i < input.length() -1; i++) {
char currentChar = input[i];
if (input[i] == '\\') {
char nextChar = input[i+1];
switch (nextChar) {
case '\"': result.push_back('\"'); break;
case '/' : result.push_back('/'); break;
case '\\': result.push_back('\\'); break;
case 'b' : result.push_back('\b'); break;
case 'f' : result.push_back('\f'); break;
case 'r' : result.push_back('\r'); break;
case 'n' : result.push_back('\n'); break;
case 't' : result.push_back('\t'); break;
default: break;
}
i++;
} else {
result.push_back(currentChar);
}
}
return result;
}
int main() {
string line;
while (getline(cin, line)) {
string s = stringToString(line);
int ret = Solution().romanToInt(s);
string out = to_string(ret);
cout << out << endl;
}
return 0;
}