store/works/solutions/leetcode/cpp/13.cpp


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

#include <string>

using std::string;

int romanDigitNumber(char romanDigit)
{
    switch (romanDigit)
    {
    case 'I':
        return 1;
    case 'V':
        return 5;
    case 'X':
        return 10;
    case 'L':
        return 50;
    case 'C':
        return 100;
    case 'D':
        return 500;
    case 'M':
        return 1000;
    };
    return 0;
}

class Solution
{
public:
    int romanToInt(string s)
    {
        int result = 0;

        int count = s.size();

        for (int i = 0; i < count; i++)
        {
            const char c = s[i];
            int num = romanDigitNumber(c);
            if (i < count - 1)
            {
                const char next = s[i + 1];
                if ((c == 'I' && (next == 'V' || next == 'X')) || (c == 'X' && (next == 'L' || next == 'C')) || (c == 'C') && (next == 'D' || next == 'M'))
                {
                    num = -num;
                }
            }

            result += num;
        }

        return result;
    }
};