package LeetCode;
public class Test {
public static void main(String[] args) {
System.out.println(intToRoman(111));
}
public static String intToRoman(int num) {
StringBuffer str = new StringBuffer();
String[] a = {"", "I","II","III","IV","V","VI","VII","VIII","IX"};
String[] b = {"", "X","XX","XXX","XL","L","LX","LXX","LXXX","XC"};
String[] c = {"", "C","CC","CCC","CD","D","DC","DCC","DCCC","CM"};
String[] d = {"", "M","MM","MMM"};
if (num >= 1 || num <= 3999) {
str.append(d[num/1000]).append(c[(num%1000)/100]).append(b[(num%100)/10]).append(a[num%10]);
}
return str.toString();
}
}
Question DescriptionMy Keypackage LeetCode;public class Test { public static void main(String[] args) { System.out.println(intToRoman(111)); } public static...