贪心算法
var romanToInt = function(s) {
let sum = 0;
//i是指针
let i = 0;
const dict = [[1000, "M"], [900, "CM"], [500, "D"], [400, "CD"], [100, "C"], [90, "XC"], [50, "L"], [40, "XL"], [10, "X"], [9, "IX"], [5, "V"], [4, "IV"], [1, "I"]];
for(const [k, v] of dict){
while(s[i] == v || s.slice(i,i + 2) == v){
if(s[i] == v){
i++;
sum += k;
continue;
}
if(s.slice(i,i + 2) == v){
i += 2;
sum += k;
}
}
}
return sum;
};