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 beforeV
(5) andX
(10) to make 4 and 9.X
can be placed beforeL
(50) andC
(100) to make 40 and 90.C
can be placed beforeD
(500) andM
(1000) to make 400 and 900.
Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.
Example 1:
Input: "III"
Output: 3
Example 2:
Input: "IV"
Output: 4
Example 3:
Input: "IX"
Output: 9
Example 4:
Input: "LVIII"
Output: 58
Explanation: L = 50, V= 5, III = 3.
Example 5:
Input: "MCMXCIV"
Output: 1994
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
1 class Solution { 2 public: 3 string sym[13] = { "M","CM","D","CD","C","XC","L","XL","X","IX","V","IV","I" }; 4 int val[13] = { 1000,900,500,400,100,90,50,40,10,9,5,4,1 }; 5 int findit(string x) { 6 static int i = 0; 7 for (i = 0; i < 13; i++) 8 if (x == sym[i]) 9 return val[i]; 10 return -1; 11 } 12 int romanToInt(string s) { 13 int ans = 0; 14 while (s != "") { 15 if (s.size() >= 2) { 16 int two = findit(s.substr(0, 2)); 17 if (two != -1) { 18 ans += two; 19 s = s.substr(2); 20 continue; 21 } 22 } 23 ans += findit(s.substr(0,1)); 24 s = s.substr(1); 25 } 26 return ans; 27 } 28 };