三天一题-20- Integer to Roman（Integer转成古罗马数字）

题目原地址：Integer to Roman

描述：
For example, two is written as II in Roman numeral, just two one’s added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.
Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:
I can be placed before V (5) and X (10) to make 4 and 9.
X can be placed before L (50) and C (100) to make 40 and 90.
C can be placed before D (500) and M (1000) to make 400 and 900.
Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.–摘自《领扣》

Example 1:
输入: " 9"
输出: "IX"
Example 2:
输入: "58"
输出: LVIII

public class IntegerToRoman {
    /**
     * Symbol       Value
     * I             1
     * V             5
     * X             10
     * L             50
     * C             100
     * D             500
     * M             1000
     *
     * @param args
     */

    public static void main(String[] args) {
        int param = 2258;
        long l = System.nanoTime();
        // String res = intToRoman(param);
        String res = intToRoman1(param);
        System.out.println(System.nanoTime()-l);
        System.out.println(res);
    }
    //判断太多的算法，在有限的条件下不适合做循环
    private static String intToRoman(int param) {
        char[] arr = {'I', 'V', 'X', 'L', 'C', 'D', 'M'};
        int key = 0;
        int len = 4;
        int divisor = 1000;
        StringBuffer stringBuffer = new StringBuffer();
        while (key < len) {
            int ans = param / divisor;
            if (ans != 0) {
                if (ans<4) {
                    for (int i = 0; i < ans; i++) {
                        stringBuffer.append(arr[6-key*2]);
                    }
                }else if(ans == 4){
                        stringBuffer.append(arr[6-key*2]+""+arr[6-key*2+1]);
                }else{
                    stringBuffer.append(arr[6 - key * 2 + 1]);
                    for (int i = 0; i < ans-5; i++) {
                        stringBuffer.append(arr[6-key*2]);
                    }
                }
            }
            param = param % divisor;
            divisor = divisor / 10;
            key++;
        }
        return stringBuffer.toString();
    }
    //这种不宜于扩展，但是在当前的条件下，实现很简单，思路清晰。
   private static String intToRoman1(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"};
           String I[] = {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"};
           return M[num/1000] + C[(num%1000)/100] + X[(num%100)/10] + I[num%10];
       }

   }


``