LeetCode 0013 - Roman to Integer

Reck Zhang

发布于 2021-08-11 10:18:09

1490

发布于 2021-08-11 10:18:09

文章被收录于专栏：Reck Zhang

Roman to Integer

Desicription

Given a roman numeral, convert it to an integer.

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

Solution

class Solution {
private:
    unordered_map<char, int> mp = {
        {'I', 1},
        {'V', 5},
        {'X', 10},
        {'L', 50},
        {'C', 100},
        {'D', 500},
        {'M', 1000}
    };

public:
    int romanToInt(string s) {
        int res = mp[s[0]];
        for(int i = 1; s[i]; i++){
            if(mp[s[i]] > mp[s[i-1]])
                res += mp[s[i]] - mp[s[i-1]] * 2;
            else
                res += mp[s[i]];
        }        
        return res;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-09，如有侵权请联系 cloudcommunity@tencent.com 删除

input