题目描述
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
code:
public class Solution {
public String intToRoman(int num) {
int[] number = {1000, 900, 500, 400, 100,90, 50, 40, 10, 9, 5, 4, 1};
String[] flags = {"M","CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"};
StringBuilder sn = new StringBuilder();
for(int i = 0 ; i < number.length ; i++)
{
while(num >= number[i])
{
num -= number[i];
sn.append(flags[i]);
}
}
return sn.toString();
}
}
本文提供了一种将整数转换为罗马数字的方法。通过定义数值与对应的罗马字符数组,使用循环遍历的方式逐级匹配并减去数值,最终拼接成目标罗马字符串。
531

被折叠的 条评论
为什么被折叠?



