题目描述
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.
思路
我们可以建立一个罗马数字和数字的对应表,这里对应了7种列出的罗马数字所能组成的唯一的13个罗马数字和阿拉伯数字的对应关系。
然后可以从大到小遍历罗马数字表,当num比当前罗马数字小时,则继续向后遍历。
若num比当前罗马数字大,则用num减去当前罗马数字,并将这个罗马数字append到结果集上,继续遍历,直到结果为0.
实现:
class Solution {
public String intToRoman(int num) {
if(num<1||num>3999){
return "";
}
StringBuilder ret=new StringBuilder();
String[] roman={"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};
int[] values= {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 };
int i=0;
while(num>0){
while(num>=values[i]){
num-=values[i];
ret.append(roman[i]);
}
i++;
}
return ret.toString();
}
}