Leetcode012 Integer to Roman

问题

Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.

给定一个阿拉伯整数，将其转换为一个罗马数字，输入的范围为1-3999

分析

（1）关于罗马数字的问题，查看Leetcode013的内容。

（2）问题的解决还是得获得阿拉伯数字中的每一位，然后计算其对应的罗马数字，同样的数字，由于其位置的不同，其罗马表示方法是不一样的。

代码1

class Solution {
    public String intToRoman(int num) {  
        int num1 = num%10;
        int num2 = num/10%10;
        int num3 = num/100%10;
        int num4 = num/1000%10;
        
        String str1 = int2Rom(num1,"I","V","X");
        String str2 = int2Rom(num2,"X","L","C");
        String str3 = int2Rom(num3,"C","D","M");
        String str4 = int2Rom(num4,"M","","");
        
        return str4+str3+str2+str1;
    }
    
    public String int2Rom(int num,String s1,String s2,String s3)
        {
            String str = "";
           if(0<num && num<4)
            {
                for(int i = 0;i<num;i++)
                {
                    str += s1;
                }
            }else if(num == 4)
            {
                str = s1+s2;
                
            }else if(num ==5)
            {
                str = s2;
            }else if(5 < num && num <9)
            {
                str = s2;
                for(int j = 0;j<num -5;j++)
                {
                    str += s1;
                }
            }else if(num ==9)
            {
                str = s1+s3;
            }else
           {
               str ="";
           }
        
        return str;
        }
}

代码2

class Solution {
    public String intToRoman(int num) {
        String[][] all = {{"","I","II","III","IV","V","VI","VII","VIII","IX"},{"","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"},{"","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"},{"","M","MM","MMM"}};
        
        int num1 = num%10;
        int num2 = num/10%10;
        int num3 = num/100%10;
        int num4 = num/1000%10;
        
        String str1 = all[0][num1];
        String str2 = all[1][num2];
        String str3 = all[2][num3];
        String str4 = all[3][num4];
        
        return str4+str3+str2+str1;
        
    }
}