LeetCode/13.cpp at master · nitin-maharana/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
/*
 * Written by Nitin Kumar Maharana
 * nitin.maharana@gmail.com
 */

class Solution {
public:
    int romanToInt(string s) {
        map<char, int> memory;

        memory['I'] = 1;
        memory['V'] = 5;
        memory['X'] = 10;
        memory['L'] = 50;
        memory['C'] = 100;
        memory['D'] = 500;
        memory['M'] = 1000;

        int result = 0;
        int len = s.length();

        for(int i = 0; i < len; i++)
        {
            if(i+1 < len)
            {
                if(memory[s[i]] < memory[s[i+1]])
                {
                    result += (memory[s[i+1]] - memory[s[i]]);
                    i++;
                    continue;
                }
            }

            result += memory[s[i]];
        }

        return result;
    }
};