I did mine using JavaScript, not really a fast algorithm but I think it's readable and allows your pals to understand what's going on.
function romanCharToInt(c) { switch (c) { case 'I': return 1; case 'V': return 5; case 'X': return 10; case 'L': return 50; case 'C': return 100; case 'D': return 500; case 'M': return 1000; } } function romanToInt(s) { let finalSum = 0; let romanChars = s.split(""); for (let i = 0; i < romanChars.length; i++) { if (romanChars[i + 1]) { if (romanCharToInt(romanChars[i]) >= romanCharToInt(romanChars[i + 1])) { finalSum += romanCharToInt(romanChars[i]); } else { finalSum += romanCharToInt(romanChars[i + 1]); finalSum -= romanCharToInt(romanChars[i]); i++; } } else { finalSum += romanCharToInt(romanChars[i]); } } return finalSum; }
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
I did mine using JavaScript, not really a fast algorithm but I think it's readable and allows your pals to understand what's going on.