ποΈ Problems
(1) Integer to Roman - LeetCode
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 an integer, convert it to a roman numeral.
Input: num = 58
Output: "LVIII"
Explanation: L = 50, V = 5, III = 3.
π€ First attempt
μ²μμλ recursive λ‘ λλ©΄μ 10 μλ¦Ώμλ‘ λλμ΄ κ°λ©΄μ μ²λ¦¬νλ €κ³ νμλλ°... <br /> λκ° κΉλνκ² μ λμ§ μμλ€...
β¨ Idea
μμ£Ό general solutionμ μλλλΌλ μ’λ κ°νΈνκ² ν μ μλ λ°©λ²μ μμκΉ ?
- κ° μ리μλ§λ€
number2roman = { }
κ°μ mapping table μ μλ€λ©΄ μ리μλ§λ€ λ³νμ ν΄μ£Όμ.
π Intuition
num
μ΄ μ£Όμ΄μ‘λ€κ³ ν λ, κ° μ리μ κ°μ ?
1μ μ리μ
num % 10;
10μ μ리μ
Math.floor((num % 100) / 10);
100μ μ리μ
Math.floor((num % 1000) / 100);
π₯ My Solution
/**
* @param {number} num
* @return {string}
*/
var intToRoman = function (num) {
const M2Roman = ["", "M", "MM", "MMM"];
const C2Roman = ["", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"];
const X2Roman = ["", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"];
const I2Roman = ["", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"];
return (
M2Roman[Math.floor(num / 1000)] +
C2Roman[Math.floor((num % 1000) / 100)] +
X2Roman[Math.floor((num % 100) / 10)] +
I2Roman[num % 10]
);
};