LeetCode 13. 罗马数字转整数

具体思路：

简单相邻元素求和；

具体代码：

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