Repository navigation
Expand file tree
/
Copy pathSolution13.cpp
More file actions
83 lines (81 loc) · 2.08 KB
/
Copy pathSolution13.cpp
File metadata and controls
83 lines (81 loc) · 2.08 KB
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
77
78
79
80
81
82
83
//
// Solution13.cpp
// Algorithm
//
// Created by Pancf on 2020/10/11.
// Copyright © 2020 Pancf. All rights reserved.
//
#include "Solution13.hpp"
int Solution13::romanToInt(std::string s)
{
// I -> 1
// V -> 5
// X -> 10
// L -> 50
// C -> 100
// D -> 500
// M -> 1000
int res = 0;
for (int i = 0; i < s.size(); ++i) {
switch (s[i]) {
case 'M':
res += 1000;
break;
case 'D':
res += 500;
break;
case 'C':
if (i < s.size() - 1) {
if (s[i + 1] == 'D') {
res += 400;
i += 1;
} else if (s[i + 1] == 'M') {
res += 900;
i += 1;
} else {
res += 100;
}
} else {
res += 100;
}
break;
case 'L':
res += 50;
break;
case 'X':
if (i < s.size() - 1) {
if (s[i + 1] == 'L') {
res += 40;
i += 1;
} else if (s[i + 1] == 'C') {
res += 90;
i += 1;
} else {
res += 10;
}
} else {
res += 10;
}
break;
case 'V':
res += 5;
break;
case 'I':
if (i < s.size() - 1) {
if (s[i + 1] == 'V') {
res += 4;
i += 1;
} else if (s[i + 1] == 'X') {
res += 9;
i += 1;
} else {
res += 1;
}
} else {
res += 1;
}
break;
}
}
return res;
}