参考derrantcm的博客,网址:https://blog.youkuaiyun.com/DERRANTCM/article/details/46963375
package algorithm;
//数字转罗马字符
public class IntegerToRoman {
/*
原题
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
题目大意
输入一个数字,将它转成一个罗马数字,输入的数字在[1, 3999]之间。
罗马数字的表示:
个位数举例: (I, 1) (II, 2) (III, 3) (IV, 4) (V, 5) (VI, 6) (VII, 7) (VIII, 8) (IX, 9)
十位数举例:(X, 10) (XI, 11) (XII, 12) (XIII, 13) (XIV, 14) (XV, 15) (XVI, 16) (XVII, 17) (XVIII, 18) (XIX, 19) (XX, 20) (XXI, 21) (XXII, 22) (XXIX, 29) (XXX, 30) (XXXIV, 34) (XXXV, 35) (XXXIX, 39) (XL, 40)
(L, 50) (LI, 51) (LV, 55) (LX, 60) (LXV, 65) (LXXX, 80) (XC, 90) (XCIII, 93) (XCV, 95) (XCVIII, 98) (XCIX, 99)
百位数举例:(C, 100) (CC, 200) (CCC, 300) (CD, 400) (D, 500) (DC, 600) (DCC, 700)(DCCC, 800) (CM, 900) (CMXCIX, 999)
千位数举例:(M, 1000) (MC, 1100) (MCD, 1400) (MD, 1500) (MDC, 1600) (MDCLXVI, 1666) (MDCCCLXXXVIII, 1888) (MDCCCXCIX, 1899) (MCM, 1900) (MCMLXXVI, 1976) (MCMLXXXIV, 1984) (MCMXC, 1990) (MM, 2000) (MMMCMXCIX, 3999)
*/
public static String integerToRoman(int input,String[][] str){
int tmp;
String result="";
int i=0;
while(input!=0){
tmp=input%10;
result=str[i][tmp-1]+result;
System.out.println("tmp%10="+tmp+" input="+input+" "+str[i][tmp-1]+" result="+result);
input=input/10;
i++;
}
return result;
}
public static void main(String[] args) {
// TODO Auto-generated method stub
String[][] str=new String[][]{
{"I","II","III","IV","V","VI","VII","VIII","IX"}, //个位表示
{"X","XX","XXX","XL","L","LX","LXX","LXXX","XC"}, //十位数
{"C","CC","CCC","CD","D","DC","DCC","DCCC","CM"},//百位数
{"M","MM","MMM","","","","","",""} //千位数
};
// /MMM CM XC IX, 3999
int input=3999;
//(MDCCCLXXXVIII, 1888)
input=1888;
String result=integerToRoman(input,str);
System.out.println("result="+result);
}
}