Leetcode-problems/13.py at main · JimNtantakas/Leetcode-problems · GitHub

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
def romanToInt(s):
    sum=0
    i=0
    while i<len(s):
        if (i<=len(s)-2):
            if (s[i]+s[i+1])=='IV':
                sum+=4
                i+=2
                continue
            elif (s[i]+s[i+1])=='IX':
                sum+=9
                i+=2
                continue
            elif (s[i]+s[i+1])=='XL':
                sum+=40
                i+=2
                continue
            elif (s[i]+s[i+1])=='XC':
                sum+=90
                i+=2
                continue
            elif (s[i]+s[i+1])=='CD':
                sum+=400
                i+=2
                continue
            elif (s[i]+s[i+1])=='CM':
                sum+=900
                i+=2
                continue
        if s[i]=='I':
            sum+=1
            i+=1
        elif s[i]=='V':
            sum+=5
            i+=1
        elif s[i]=='X':
            sum+=10
            i+=1
        elif s[i]=='L':
            sum+=50
            i+=1
        elif s[i]=='C':
            sum+=100
            i+=1
        elif s[i]=='D':
            sum+=500
            i+=1
        elif s[i]=='M':
            sum+=1000
            i+=1
    return sum