LeetCode 13. Roman to Integer

Given a roman numeral, convert it to an integer.

Input is guaranteed to be within the range from 1 to 3999.

class Solution {
public:
    int romanToInt(string s) {
        map<char, int>m;
        m['I'] = 1;
        m['V'] = 5;
        m['X'] = 10;
        m['L'] = 50;
        m['C'] = 100;
        m['D'] = 500;
        m['M'] = 1000;
        int len = s.size();
        int i;
        int sum = m[s[0]];
        for(i = 1; i < len; i ++){
            int num = m[s[i]];
            int lnum = m[s[i - 1]];
            if(num <= lnum) sum += num;
            else sum += num - lnum * 2;
        }
        return sum;
    }
};