Leet 13 – Roman to Integer

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

Symbol       Value
I             1
V             5
X             10
L             50
C             100
D             500
M             1000

For example, two is written as II in Roman numeral, just two one’s added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

• I can be placed before V (5) and X (10) to make 4 and 9.
• X can be placed before L (50) and C (100) to make 40 and 90.
• C can be placed before D (500) and M (1000) to make 400 and 900.

Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.

Example 1:

Input: "III"
Output: 3

Example 2:

Input: "IV"
Output: 4

Example 3:

Input: "IX"
Output: 9

Example 4:

Input: "LVIII"
Output: 58
Explanation: L = 50, V= 5, III = 3.

Example 5:

Input: "MCMXCIV"
Output: 1994
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

My Solution:

I will create a map between char and integer,  and then loop for each character in the string and add it’s value to a total, for special cases as: IV I will subtract the previous value twice(because it is always added priorly) and that’s it.

class Solution {
public:

    int romanToInt(string s) {


        map<char, int> roman_map;
        auto sum = 0, previous = 0;


        roman_map.insert(pair<char, int>('I', 1));
        roman_map.insert(pair<char, int>('V', 5));
        roman_map.insert(pair<char, int>('X', 10));
        roman_map.insert(pair<char, int>('L', 50));
        roman_map.insert(pair<char, int>('C', 100));
        roman_map.insert(pair<char, int>('D', 500));
        roman_map.insert(pair<char, int>('M', 1000));

        for (const auto& c : s) {
            auto value = roman_map[c];
            sum += value;
            if (previous < value) {
                sum -= previous * 2;
            }
            previous = value;


        }
        return sum;

    }
};

Time Complexity: O(n) –  The length of the string to be converted

Space Complexity: O(1) constant time, because there are 3 variables.