leetcode/roman_to_integer.cpp at master · PaulKovalov/leetcode · 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
class Solution {
public:
    int romanToArabic(char c) {
        switch(c){
            case 'M': {
                return 1000;
            }
            case 'D': {
                return 500;
            }
            case 'C':{
                return 100;
            }
            case 'L':{
                return 50;
            }
            case 'X':{
                return 10;
            }
            case 'V':{
                return 5;
            }
            case 'I':{
                return 1;
            }
        }
        return 0;
    }
    int romanToInt(string s) {
        vector<int> ints;
        for (int i = 0; i < s.length(); ++i) {
            ints.push_back(romanToArabic(s[i]));
        }
        int sum = 0;
        for (int i = 0; i < ints.size() - 1; ++i) {
            if (ints[i] < ints[i + 1]) {
                ints[i] = -ints[i];
            }
            sum += ints[i];
        }
        sum += ints[ints.size() - 1];
        return sum;

    }
};