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.
解法一
建立两个数组保存罗马字符与其对应的数字,遍历数字,分为四种情况(x<4,x4,4<x<9,x9)从最高位开始逐一判断,将对应的字符加进结果中
public String intToRoman(int num) {
String s="";
char[] roman={'M', 'D', 'C', 'L', 'X', 'V', 'I'};
int[] value={1000,500,100,50,10,5,1};
for(int i=0;i<7;i+=2)
{
int x=num/value[i];
if(x<4)
for(int j=1;j<=x;j++)
s+=roman[i];
else if(x==4)
{
s=s+roman[i]+roman[i-1];
}
else if(x>4&&x<9)
{
s+=roman[i-1];
for(int j=6;j<=x;j++)
s+=roman[i];
}
else
s=s+roman[i]+roman[i-2];
num%=value[i];
}
return s;
}
Runtime: 34 ms, faster than 99.81% of Java online submissions for Integer to Roman.
Memory Usage: 39.5 MB, less than 70.28% of Java online submissions for Integer to Roman.
还可以利用题目给出的限制条件(输入的数字在1~3999)编写代码:参考