12.整数转罗马数字

题目描述：

示例

示例 1:；输入: 3；输出: "III"
示例 2:输入: 4；输出: "IV"
示例 3:输入: 9；输出: "IX"
示例 4:输入: 58；输出: "LVIII"；解释: L = 50, V = 5, III = 3.
示例 5:输入: 1994；输出: "MCMXCIV"解释: M = 1000, CM = 900, XC = 90, IV = 4.

解答1:两个数组

String rs = "";
        //可以通过两个数组，一一对应就可以
        int[] vals = { 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" };
        for (int i = 0; i < vals.length; i++) {
            while (num >= vals[i]) {
                rs = rs + romans[i];
                num -= vals[i];
            }
        }
        return rs;

解答2:map和list实现

public static String intToRoman(int num) {
        // 需要LinkedHashMap linkedMap在于存储数据你想保持进入的顺序与被取出的顺序一致的话，优先考虑LinkedMap
        Map map3 = new LinkedHashMap<>();
        map3.put(1000, "M");
        map3.put(900, "CM");
        map3.put(500, "D");
        map3.put(400, "CD");
        map3.put(100, "C");
        map3.put(90, "XC");
        map3.put(50, "L");
        map3.put(40, "XL");
        map3.put(10, "X");
        map3.put(9, "IX");
        map3.put(5, "V");
        map3.put(4, "IV");
        map3.put(1, "I");
        
        String rsString = "";
        // 遍历map
        for (Map.Entry entry : map3.entrySet()) {
            while (num >= entry.getKey()) {
                //拼接字符
                rsString = rsString + entry.getValue();
                //更新值
                num -= entry.getKey();
            }
        }
        return rsString;
        
        /*
        // 对key排序，最好用TreeMap
        Map map = new TreeMap<>();
        map.put(1, "I");
        map.put(4, "IV");
        map.put(5, "V");
        map.put(9, "IX");
        map.put(10, "X");
        map.put(40, "XL");
        map.put(50, "L");
        map.put(90, "XC");
        map.put(100, "C");
        map.put(400, "CD");
        map.put(500, "D");
        map.put(900, "CM");
        map.put(1000, "M");
        
    
        // 得将map转为list排序
        List> list = new ArrayList>(map.entrySet());
        // map中key默认是升序，需要通过new Comparator进行逆序排序
        Collections.sort(list, new Comparator>() {
            public int compare(Map.Entry o1, Map.Entry o2) {
                // 2-1
                return o2.getKey() - o1.getKey();
            }
        });
        // 需要LinkedHashMap linkedMap在于存储数据你想保持进入的顺序与被取出的顺序一致的话，优先考虑LinkedMap
        Map map2 = new LinkedHashMap<>();
        for (int i = 0; i < list.size(); i++) {
            // 将list内容存map
            Map.Entry entry = list.get(i);
            map2.put(entry.getKey(), entry.getValue());

        }
        String rsString = "";
        // 遍历map
        for (Map.Entry entry : map2.entrySet()) {
            while (num >= entry.getKey()) {
                //拼接字符
                rsString = rsString + entry.getValue();
                //更新值
                num -= entry.getKey();
            }
        }
        return rsString;
         */
        
    
        
         /*
        String rs = "";
        //可以通过两个数组，一一对应就可以
        int[] vals = { 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" };
        for (int i = 0; i < vals.length; i++) {
            while (num >= vals[i]) {
                rs = rs + romans[i];
                num -= vals[i];
            }
        }
        return rs;
        */

    }

注意：

1.TreeMap 可以用于key排序，若排序可转list。
2.linkedMap在于存储数据你想保持进入的顺序与被取出的顺序一致的话，优先考虑LinkedMap.
3.HashMap 可以用于value排序，若排序可转list。