blob: 1389754401b9d5f39e47f4513b89a9e65769edeb (
plain)
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
|
#include "leetcode.h"
class Solution {
public:
int romanToInt(string s) {
int ans = 0, num = 0;
for (int i = s.size() - 1; ~i; i--) {
switch (s[i]) {
case 'I':
num = 1;
break;
case 'V':
num = 5;
break;
case 'X':
num = 10;
break;
case 'L':
num = 50;
break;
case 'C':
num = 100;
break;
case 'D':
num = 500;
break;
case 'M':
num = 1000;
break;
}
if (4 * num < ans)
ans -= num;
else
ans += num;
}
return ans;
}
};
int main() {
Solution obj;
cout << obj.romanToInt("MCMXCIVMCMXCIV");
}
|