Leetcode--12. 整数转罗马数字[2020. 11. 12]

Leetcode–12. 整数转罗马数字

前言

  这题的其实还是比较简单的，最直观的方法应该是硬编码法，贪心也是一种非常好的解法。

1. 首先是硬编码，我们可以这么去理解，输入的数的每个位上的数字都有对应的罗马字符，其中千百十个位都不相同。我们只要列举出各个位上的所有可能性，然后对应入座即可。
   

2. 贪心算法的本质，是寻找当前最符合的情况，即寻找当前时间下做出最佳可能决策的算法。对于本题，我们只需要找到符合条件的数值，将罗马数值添加到结果，并将num减去它直到num<=0即可。

题目

罗马数字包含以下七种字符： I， V， X， L，C，D 和 M。

输入: 3
输出: “III”

输入: 4
输出: “IV”

输入: 9
输出: “IX”

代码

// 1. 硬编码 
class Solution {
    public String intToRoman(int num) {
       String thousands[] = {"","M", "MM","MMM"};
       String hundred[]={"","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"};
       String tens[]={"","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"};
       String ones[] = {"","I","II","III","IV","V","VI","VII","VIII","IX"};
        return (thousands[num/1000] + hundred[num%1000/100]+tens[num%100/10]+ones[num%10]);
    }
}

// 2. 贪心算法
class Solution {
    public String intToRoman(int num) {
        String[] params = {"M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I"};
        int[] values = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1};
        StringBuilder res = new StringBuilder();
        for(int i=0; i<values.length; i++){
            while(num>=values[i]){
                num -= values[i];
                res.append(params[i]);
            }
        }
        return res.toString();
    }
}

结束语

  显然贪心算法的拓展性会更好，当数字的位数大了，硬编码就会比较麻烦。