[leetcod] 12. Integer to Roman-CSDN博客

本文链接：https://blog.csdn.net/w5688414/article/details/87560949

Description

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, two is written as II in Roman numeral, just two one’s added together. Twelve is written as, XII, which is simply X + II. The number twenty seven 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 is guaranteed to be within the range from 1 to 3999.

Example 1:

Input: 3
Output: "III"

Example 2:

Input: 4
Output: "IV"

Example 3:

Input: 9
Output: "IX"

Example 4:

Input: 58
Output: "LVIII"
Explanation: L = 50, V = 5, III = 3.

Example 5:

Input: 1994
Output: "MCMXCIV"
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

分析

题目的意思是：把一个整数变为一个罗马数字。

子母	M	D	C	L	X	V	I
代表数字	1000	500	100	50	10	5	1

规则

相同的数字连写，所表示的数等于这些数字相加得到的数。如 XXX表示 30
小的数字在大的数字的右边，所表示的数等于这些数字相加得到的数如VIII 表示8
小的数字(限于I, X, C)在大的数字的左边，所表示的数等于大数减去小的数：如IV 表示4
在一个数的上面画一条横线，表示这个数增值1000倍(由于题目只考虑4000以内的数，所以这条规则不用考虑)。

五个组数规则

I, X, C：最多只能连用3个，如果放在大数的左边，只能用1个。
V, L, D: 不能放在大数的左边，只能使用一个。
I 只能用在V和X的左边。 IV表示4, IX表示9
X只能放在L,C左边。 XL 表示40, XC表示90
C只能用在D, M左边。 CD 表示400, CM表示900

C++代码

class Solution {
public:
    string intToRoman(int num) {
        string res="";
        vector<int> key={1000,900,500,400,100,90,50,40,10,9,5,4,1};
        vector<string> value={"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};
        for(int i=0;i<key.size();i++){
            int count=num/key[i];
            for(int j=0;j<count;j++){
                res+=value[i];
            }
            num=num%key[i];
        }
        return res;
    }
};

Python代码

class Solution:
   def intToRoman(self, num: int) -> str:
       values=[1000,900,500,400,100,90,50,40,10,9,5,4,1]
       keys=['M',"CM",'D','CD','C','XC','L','XL','X','IX','V','IV','I']
       res=''
       for i in range(len(values)):
           count = num//values[i]

           for j in range(count):
               res+=keys[i]
           num=num%values[i]
       return res