[leetcode] 13. Roman to Integer
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
Symbol Value
I 1
V 5
X 10
L 50
C 100
D 500
M 1000
For example, 2 is written as II in Roman numeral, just two one's added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II.
Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:
- I can be placed before V (5) and X (10) to make 4 and 9.
- X can be placed before L (50) and C (100) to make 40 and 90.
- C can be placed before D (500) and M (1000) to make 400 and 900.
Given a roman numeral, convert it to an integer.
var romanToInt = function(s) {
const integer = {
I:1,
V:5,
X:10,
L:50,
C:100,
D:500,
M:1000
}
const romanNumbers = [];
const romanNumbers2 = [];
for (let i = 0; i < s.length; i++) {
const index = Object.keys(integer).indexOf(s[i]);
const key = Object.keys(integer)[index]
romanNumbers.push(Number(integer[key]))
}
let pointer2 = 0;
const pointers = [];
for (let pointer1 = 0; pointer1 < romanNumbers.length; pointer1++) {
pointer2++;
if(romanNumbers[pointer1] < romanNumbers[pointer2]) {
pointers.push(pointer1)
pointers.push(pointer2)
romanNumbers2.push(romanNumbers[pointer2] - romanNumbers[pointer1])
}
}
pointers.forEach(x => {
romanNumbers[x] = null
})
let result = 0;
[...romanNumbers,...romanNumbers2].forEach(x => result += x)
return result;
};
로마숫자를 정수로 변경하는 알고리즘이다
easy가 맞나 싶을정도로 예외가 많아 좀 막코딩을 한 기분이 든다 ㅡㅡ;;
다른 분들 코드보고 리팩토링 좀 해야겠다
은근 어렵네...