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.

就是说把int数值转换为罗马数字，转换规则即如题所述。我原来用的是if else多个分支，用数组把1，5， 10...1000存下来，然后判断该数所属的区间，在分别写字符串。后来在评论区看到更为简洁的代码，就是把所有特殊值都存下来(我原来也考虑过但感觉有点投机)，然后比大小再拼接字符串即可。两种方法都是100% 100%。 

我的代码：

class Solution {
public:
    string intToRoman(int num) {
        int arr[] = {1000, 500, 100, 50, 10, 5, 1};
        string s = "MDCLXVI";
        string ss;
        while (num) {
            for (int i = 0; i < 7; i+=2) {
                if (num / arr[i] > 0) {
                    if (num / arr[i] == 4) {
                        ss += s[i];
                        ss += s[i-1];
                    } else if (num / arr[i] == 5) {
                        ss += s[i-1];
                    } else if (num / arr[i] == 9) {
                        ss += s[i];
                        ss += s[i-2];
                    } else if (num / arr[i] < 4) {
                        for (int j = 0; j < num / arr[i]; j++)
                            ss += s[i];
                    } else if (num / arr[i] < 9) {
                        ss += s[i-1];
                        for (int j = 0; j < num / arr[i] - 5; j++)
                            ss += s[i];
                    }
                }
                num = num - (num/arr[i]) * arr[i];
            }
        }
        return ss;
    }
};

更为简洁的代码：

class Solution {
public:
    string intToRoman(int num) {
        string numerals [] = {"I","IV","V","IX","X","XL","L","XC","C","CD","D","CM","M"};
        int values [] = {1,4,5,9,10,40,50,90,100,400,500,900,1000};
        string result = "";
        for (int i = size(numerals)-1; i >= 0; i--){
            while (num >= values[i]){
                result += numerals[i];
                num -= values[i];
            }
        }
        return result;
    }
};