1. 题目描述(LeetCode 12)
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
2. 解决思路
根据上次做的罗马数字转化为整数那一题,掌握了罗马数字的记数规则和基本的组数规则,因此我们可以很快地找到解题的突破口,即:
罗马数字的基本型为:I=1,V=5,X=10,L=50,C=100,D=500,M=1000,相同的罗马数字最多不能超过三个。所以对于4只能表示为5-1即IV,左减右加。同理,9=IX,40=XL,90=XC,400=CD,900=CM。根据这些基本型,可以通过贪心算法,每次匹配最大值得到罗马数字.
3. 完整代码
import java.util.Scanner;
public class IntoRo {
public static void main(String[] args){
IntoRo itr = new IntoRo();
//创建输入对象
@SuppressWarnings("resource")
Scanner sc=new Scanner(System.in);
//获取用户输入的整数值
int num=0;
System.out.print("请输入1--3999的任意整数:");
num=sc.nextInt();
System.out.println("你输入的整数为:"+ num);
//itr.romanToInt(str);
String result = itr.intToRoman(num);
System.out.println("对应的罗马数字为:"+result);
}
public static String intToRoman(int number) {
int[] base = { 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 };
String[] str = { "M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX",
"V", "IV", "I" };
String roman = "";
int i = 0;
while (number != 0) {
if (number >= base[i]) {
number -= base[i];
roman += str[i];
} else
i++;
}
return roman;
}
}