1
# Runtime: 89 ms (Top 30.66%) | Memory: 13.8 MB (Top 76.49%)
2
class Solution:
3
    def romanToInt(self, s: str) -> int:
4
        roman = {"I": 1, "V": 5, "X": 10, "L": 50, "C": 100, "D": 500, "M": 1000}
5

6
        sum = 0
7
        for i in range(0, len(s) - 1):
8
            curr = roman[s[i]]
9
            nxt = roman[s[i + 1]]
10
            if curr < nxt:
11
                sum -= curr
12
            else:
13
                sum += curr
14
        sum += roman[s[-1]]
15
        return sum