WEI-CHENG CHEN

說明

解法:

class Solution {
public:
    int romanToInt(string s) {
        unordered_map<char, int> m = {
            {'I', 1}, {'V', 5}, {'X', 10}, {'L', 50},
            {'C', 100}, {'D', 500}, {'M', 1000}
        };
        int ans = 0;

        for(int i=0;i<s.size();i++){
            int value = m[s[i]];
            if(value<m[s[i+1]]) ans -= value;
            else ans += value;
        }
        return ans;

    }
};