[TIL] Algorithm 5

Algotihm

1. 문제

2. 결과

function romanToNum(s) {
  const numObj = {
    "I" : 1,
    "V" : 5,
    "X" : 10,
    "L" : 50,
    "C" : 100,
    "D" : 500,
    "M" : 1000
  }
  let result = 0;
  console.log(numObj["X"]);
  
  for(let i = 0; i < s.length; i++) {
    console.log('i+1: ', numObj[s[i+1]]);
    if(numObj[s[i]] < numObj[s[i+1]]) {
      result = result - numObj[s[i]];
    } else {
      result = result + numObj[s[i]];
    }
  }
  return result; // 12

}
romanToNum('XII');