[LeetCode]-011-Integer_to_Roman

Given an integer, convert it to a roman numeral.

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

题目大意：把一个整数转换成罗马数字

 public class Solution{
     private String[][] arr = {
         {"0","I","II","III","IV","V","VI","VII","VIII","IX"},
         {"0","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"},
         {"0","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"},
         {"0","M","MM","MMM"}
     };
     public String intToRoman(int num) {
         if(num<0 || num>3999)
             return "";
         StringBuilder res = new StringBuilder();
         int tmp = num;
         if((tmp/1000)!=0)
             res.append(arr[3][tmp/1000]);
         tmp = tmp%1000;
         if((tmp/100)!=0)
             res.append(arr[2][tmp/100]);
         tmp = tmp%100;
         if((tmp/10)!=0)
             res.append(arr[1][tmp/10]);
         tmp = tmp%10;
         if(tmp!=0)
             res.append(arr[0][tmp]);
         return res.toString();
     }

     public static void main(String[] args){
         int param = 1234;
         if(args.length==1){
             param = Integer.valueOf(args[0]);
         }
         Solution solution = new Solution();
         String res = solution.intToRoman(param);
         System.out.println(res);
     }
 }