整数转罗马数字

Integer to Roman

来源： LeetCode Integer to Roman

题目描述

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.

思路分析

需要特殊处理4，9，40，90，400，900
我们不考虑0也就是需要特殊处理在该位为4/9的情况

代码

class Solution {
public:
    string intToRoman(int num) {
        // 3999
        // 9 -> VIIII -> IX
        // 99 -> LXXXXIX -> XCIX
        // 999 -> DCCCCXCIX -> MCMCXIX
        // 3999 -> MMMCMCXIX
        // 仅需特殊处理4，9，40，90，400，900
        string a[] = {"I", "V", "X", "L", "C", "D", "M"};
        string res;
        int n = 0;
        while(num){
            int temp; string s;
            temp = num%10; // 取出该位
            switch(temp){
                case 4: s+=a[n]; s+= a[n+1]; break;
                case 9: s+=a[n]; s+= a[n+2]; break;
                default :
                    if(temp >4){
                        s+=a[n+1];
                        temp -= 5;
                    }
                    while(temp){
                        s += a[n];
                        --temp;
                    }
            }
            res = s+res;// 得到该位
            n += 2;
            num /= 10; // 下一位 
        }
        return res;
    }
};

算法分析

- 时间复杂度：O(bit(num))
- 空间复杂度：O(1)

代码改进

数据量过小直接设定转换

string intToRoman(int num) 
    {
        char* c[4][10] = {
            {"","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"}
        };
        string roman;
        roman.append(c[3][num / 1000]);
        roman.append(c[2][num / 100 % 10]);
        roman.append(c[1][num / 10 % 10]);
        roman.append(c[0][num % 10]);
         
        return roman;
    }