codeDump/LeetCodeQuestions/Roman_To_int.cpp at main · akkupy/codeDump · 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
52
53
54
55
56
57
58
59
60
class Solution {
public:
    int romanToInt(string s) {
       int d=0;
       for(int i=0;i<s.length();i++){
            if(s[i]=='I'){
                if(s[i+1]=='V'){
                    d=d+4;
                    i++;
                }
                else if(s[i+1]=='X'){
                    d=d+9;
                    i++;
                }
                else{
                d=d+1;
                }
            }
            else if(s[i]=='V'){
                d=d+5;
            }
            else if(s[i]=='X'){
                if(s[i+1]=='L'){
                    d=d+40;
                    i++;
                }
                else if(s[i+1]=='C'){
                    d=d+90;
                    i++;
                }
                else{
                d=d+10;
            }
            }
            else if(s[i]=='L'){
                d=d+50;
            }
            else if(s[i]=='C'){
                if(s[i+1]=='D'){
                    d=d+400;
                    i++;
                }
                else if(s[i+1]=='M'){
                    d=d+900;
                    i++;
                }
                else{
                d=d+100;
            }
            }
            else if(s[i]=='D'){
                d=d+500;
            }
            else if(s[i]=='M'){
                d=d+1000;
            }
        }
        return d;
    }
};