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.
题目解析:就是阿拉伯数字转换为罗马数字,然后罗马数值由I, V, X, L, C, D and M组成,阿拉伯数字由1,2,3,4,5,6,7,8,9,0组成,由此可知找到数字组成规律即可。
解题思路:暴力破解,找到每个位数的规则即可;
因为题目数字范围是1到3999,便可以找到千位数的规则:{"", “M”, “MM”, “MMM”},即无千位、1000,2000,3000;
百位数的规则:{"", “C”, “CC”, “CCC”, “CD”, “D”, “DC”, “DCC”, “DCCC”, “CM”};
十位数的规则:{"", “X”, “XX”, “XXX”, “XL”, “L”, “LX”, “LXX”, “LXXX”, “XC”};
个位数的规则:{"", “I”, “II”, “III”, “IV”, “V”, “VI”, “VII”, “VIII”, “IX”};
然后分别获取输入数值的每个位数的数值,找到相应的罗马数值即可。
解题代码:
class Solution {
public:
string intToRoman(int num) {
vector<string> thouand{"", "M", "MM", "MMM"};//“”,1000,2000,3000
vector<string> hundred{"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"};//“”,100,200,300,400,500,600,700,800,900
vector<string> ten{"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"};//“”,10,20,30,40,50,60,70,80,90
vector<string> individual{"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"};//“”,1,2,3,4,5,6,7,8,9
return thouand[num / 1000] + hundred[(num % 1000) / 100] + ten[(num % 100) / 10] + individual[num % 10];
}
};
解法性能:
总结:找到对应阿拉伯数值对应的罗马数值。