-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy path13.cpp
More file actions
58 lines (58 loc) · 1.28 KB
/
13.cpp
File metadata and controls
58 lines (58 loc) · 1.28 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
// Author: btjanaka (Bryon Tjanaka)
// Problem: (Leetcode) 13
// Title: Roman to Integer
// Link: https://leetcode.com/problems/roman-to-integer
// Idea: Build a state machine that modifies the result based on what characters
// it sees.
// Difficulty: easy
// Tags: implementation
class Solution {
public:
int romanToInt(string s) {
int res = 0;
for (int i = 0; i < s.size(); ++i) {
switch (s[i]) {
case 'I':
++res;
break;
case 'V':
res += 5;
if (i > 0 && s[i - 1] == 'I') {
res -= 2;
}
break;
case 'X':
res += 10;
if (i > 0 && s[i - 1] == 'I') {
res -= 2;
}
break;
case 'L':
res += 50;
if (i > 0 && s[i - 1] == 'X') {
res -= 20;
}
break;
case 'C':
res += 100;
if (i > 0 && s[i - 1] == 'X') {
res -= 20;
}
break;
case 'D':
res += 500;
if (i > 0 && s[i - 1] == 'C') {
res -= 200;
}
break;
case 'M':
res += 1000;
if (i > 0 && s[i - 1] == 'C') {
res -= 200;
}
break;
}
}
return res;
}
};