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 beforeV
(5) andX
(10) to make 4 and 9.X
can be placed beforeL
(50) andC
(100) to make 40 and 90.C
can be placed beforeD
(500) andM
(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.
题意:
给一个整数n( 1<=n<=3999),转换为罗马数的形式输出,罗马数从左到右为高位到低位,其它对应规则如下:
Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000
除以上外
4 -> IV ; 9->IX;
40-> XL ; 90->XC;
400->CD ; 900->CM;
分析:
从罗马数最高位对应的阿拉伯数(即1000)开始往下遍历,依次递减 并记录相应的罗马字符。实现如下:
Code & Python
class Solution:
def intToRoman(self, x: 'int') -> 'str':
if not x:return
transf = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]
ss = ['M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I']
ans = ''
for i in range(len(transf)):
while transf[i]<=x:
x-=transf[i]
ans += ss[i]
return ans
结果:
Runtime: 116 ms, faster than 83.53% of Python3 online submissions for Integer to Roman.
Memory Usage: 12.5 MB, less than 92.47% of Python3 online submissions for Integer to Roman.
Code & C++
class Solution {
public:
string intToRoman(int x) {
if(x==0)return "";
vector<int> transf ={1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
vector<string> ss={"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};
string ans="";
for(int i=0;i<transf.size();++i){
while(transf[i]<=x){
x-=transf[i];
ans += ss[i];
}
}
return ans;
}
};
结果:
Runtime: 60 ms, faster than 42.91% of C++ online submissions for Integer to Roman.
Memory Usage: 33.8 MB, less than 24.00% of C++ online submissions for Integer to Roman.
Status:ACCEPTED