Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
思路:创建两个数组,将特殊临界的罗马数字与阿拉伯数字形成一一映射关系,从大到小的顺序排列,然后将给定的数字num尝试一一减去数组中的数字,每减去数组中的一个阿拉伯数字,字符串str应当加上这个阿拉伯数字映射的罗马数字。
注:采用StringBuffer运行效率更高,可以查看这篇博客String,StringBuffer,StringBuilder的区别
Java代码实现
public class Solution {
public String intToRoman(int num) {
String[] strs = { "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 };
//采用StringBuffer运行效率更高
StringBuffer str = new StringBuffer();
for(int i = 0; i < values.length; i++){
while(num >= values[i]){
num -= values[i];
str.append(strs[i]);
}
}
return str.toString();
}
}