LeetCode 12. Integer to Roman

一 题目

  Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

Symbol       Value
I             1
V             5
X             10
L             50
C             100
D             500
M             1000

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:

Input: 3
Output: "III"

Example 2:

Input: 4
Output: "IV"

Example 3:

Input: 9
Output: "IX"

Example 4:

Input: 58
Output: "LVIII"
Explanation: L = 50, V = 5, III = 3.

Example 5:

Input: 1994
Output: "MCMXCIV"
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

二 分析

  本题是medium 难道的题目。就是把阿拉伯数字转换为罗马数字。现在罗马数字使用很少了，我觉得就是表盘上还能看到。其他的少见了。主要就是繁琐。

递归法：

这个容易直观想到，就是得翻译下规则。很容易理解

public static void main(String[] args) {
		String res = intToRoman(58);
		System.out.println(res);
		 res = intToRoman(1994);
		System.out.println(res);
	}
	
     public static String intToRoman(int num) {
          String[][] unit ={{"I","V"},{"X","L"},{"C","D"},{"M"}};
          StringBuffer sb = new StringBuffer();
          int i=3;   
           while(i>=0){
        	  double tmp = num /(int)Math.pow(10, i);
        		 if(tmp<=3){
        			 while(tmp>0){
        				 sb.append(unit[i][0]);
        	        	  tmp--;
        	        	  }	 
        		 }else if(tmp==4){
        			 sb.append(unit[i][0]+unit[i][1]);
        		 }else if(tmp==5){
        			 sb.append(unit[i][1]);
        		 }else if(tmp>5&& tmp<9){
        			 sb.append(unit[i][1]);
        			 tmp = tmp-5;
        			 while(tmp>0){
        				 sb.append(unit[i][0]);
       	        	     tmp--;
       	        	  }
        		 }else{
        			 sb.append(unit[i][0]+unit[i+1][0]);
        		 }
        		 num = num%(int)Math.pow(10, i);
        	  i--;        	 
           }         
    	 
    	 return sb.toString();
    	 
    }

Runtime: 6 ms, faster than 20.21% of Java online submissions for Integer to Roman.

Memory Usage: 36.2 MB, less than 100.00% of Java online submissions for Integer to Roman.

优点：就是内存使用少，缺点：太慢了。

我猜测就是反复拼串就慢。怎么优化呢？

单纯就题目而言，有个投机的办法。先提前根据题目要求1-3999算好对应位数的值。减少中间拼串，分别计算千位、百位、十位，个位。

    public String intToRoman(int num) {
        String[][] unit ={ {"","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"}};
		StringBuffer sb = new StringBuffer();
			sb.append(unit[3][num / 1000 % 10]);
			sb.append(unit[2][num / 100 % 10]);
			sb.append(unit[1][num / 10 % 10]);
			sb.append(unit[0][num % 10]);
	         
	        return sb.toString();
    }

Runtime: 4 ms, faster than 68.10% of Java online submissions for Integer to Roman.

Memory Usage: 36.7 MB, less than 100.00% of Java online submissions for Integer to Roman.

这样就快多了。先到这里，明天再看看大神们用了啥更好的办法。