-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path13.py
32 lines (31 loc) · 817 Bytes
/
13.py
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
# https://leetcode.com/problems/roman-to-integer/description/
class Solution:
def romanToInt(self, s: str) -> int:
value = {
'I': 1,
'IV': 4,
'V': 5,
'IX': 9,
'X': 10,
'XL': 40,
'L': 50,
'XC': 90,
'C': 100,
'CD': 400,
'D': 500,
'CM': 900,
'M': 1000
}
res = 0
combo = ""
for c in s:
combo += c
if len(combo) == 2:
if combo in value:
res += value[combo]
combo = ""
else:
res += value[combo[0]]
combo = combo[1]
res += value[combo] if combo in value else 0
return res