AAlgoLoopSpaced repetition for LeetCode
MEDIUMMath / Number TheoryLeetCode ↗

Integer to Roman

The key idea

Roman numerals are written largest-value-first, so greedily subtracting the biggest symbol that still fits is always optimal. Include the six subtractive pairs (CM, CD, XC, XL, IX, IV) as first-class entries in the value table, so the same greedy loop handles both the additive and subtractive cases with no special branches.

Problem

Roman numerals are represented by seven symbols: I, V, X, L, C, D and M, with values 1, 5, 10, 50, 100, 500 and 1000.

For example, 2 is written as II in Roman numerals, just two ones 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.

Constraints

Examples

Input: num = 3749 Output: "MMMDCCXLIX"
Input: num = 58 Output: "LVIII"
Input: num = 1994 Output: "MCMXCIV"

Complexity

Time: O(1) Space: O(1)

See the full solution

410310
Step-by-step visualization
Start free →

More Math / Number Theory problems