| | |
| | | |
| | | return sb.toString(); |
| | | } |
| | | public static String intToRomans(int num) { |
| | | public static String convertArabicToRoman(int num) { |
| | | int[] values={1000,900,500,400,100,90,50,40,10,9,5,4,1}; |
| | | String[] romans={"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"}; |
| | | StringBuilder sb=new StringBuilder(); |
| | | for(int i=0;i<values.length;i++){ |
| | | while(num>=values[i]){ |
| | | num=num-values[i]; |
| | | sb.append(romans[i]); |
| | | } |
| | | } |
| | | return sb.toString(); |
| | | } |
| | | /** |
| | | * 把罗马数字转换为阿拉伯数字 |
| | | * @param m |
| | | * @return |
| | | */ |
| | | public static int convertRomanToArabic(String m) { |
| | | int graph[] = new int[400]; |
| | | graph['I'] = 1; |
| | | graph['V'] = 5; |
| | | graph['X'] = 10; |
| | | graph['L'] = 50; |
| | | graph['C'] = 100; |
| | | graph['D'] = 500; |
| | | graph['M'] = 1000; |
| | | char[] num = m.toCharArray(); |
| | | int sum = graph[num[0]]; |
| | | for (int i = 0; i < num.length - 1; i++) { |
| | | if (graph[num[i]] >= graph[num[i + 1]]) { |
| | | sum += graph[num[i + 1]]; |
| | | } else { |
| | | sum = sum + graph[num[i + 1]] - 2 * graph[num[i]]; |
| | | } |
| | | } |
| | | return sum; |
| | | } |
| | | |
| | | public static String intToRomanTwo(int num) { |
| | | String M[] = {"", "M", "MM", "MMM"}; |
| | | String C[] = {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"}; |
| | | String X[] = {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"}; |