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 1000For example, 2 is written as II in Roman numeral, just two ones added together. 12 is written as XII, which is simply X + II. The number 27 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:
Ican be placed beforeV(5) andX(10) to make 4 and 9.Xcan be placed beforeL(50) andC(100) to make 40 and 90.Ccan be placed beforeD(500) andM(1000) to make 400 and 900.
Given a roman numeral, convert it to an integer
Example 1:
Input: s = "III"
Output: 3
Explanation: III = 3.
Example 2:
Input: s = "LVIII"
Output: 58
Explanation: L = 50, V= 5, III = 3.
Example 3:
Input: s = "MCMXCIV"
Output: 1994
Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.
Constraints:
1 <= s.length <= 15scontains only the characters('I', 'V', 'X', 'L', 'C', 'D', 'M').- It is guaranteed that
sis a valid roman numeral in the range[1, 3999].
Python Code
class Solution(object):
def intToRoman(self, numb):
temp = numb
list_digits = []
while temp > 0:
list_digits.append(temp % 10)
temp = int(temp / 10)
self.numberlength += 1
if self.numberlength == 4:
for i in range(list_digits[3]):
self.output += "M"
self.numberlength -= 1
if self.numberlength == 3:
self.numberlength -= 1
if list_digits[2] * 100 == 400 or list_digits[2] * 100 == 900:
self.output += self.exceptionSymbols[self.position(
list_digits[2] * 100)]
else:
if list_digits[2] * 100 == 500:
self.output += "D"
elif list_digits[2] * 100 == 800:
self.output += "DCCC"
elif list_digits[2] * 100 == 700:
self.output += "DCC"
elif list_digits[2] * 100 == 600:
self.output += "DC"
elif list_digits[2] * 100 == 300:
self.output += "CCC"
elif list_digits[2] * 100 == 200:
self.output += "CC"
elif list_digits[2] * 100 == 100:
self.output += "C"
else:
self.output += ""
if self.numberlength == 2:
self.numberlength -= 1
if list_digits[1] * 10 == 40 or list_digits[1] * 10 == 90:
self.output += self.exceptionSymbols[self.position(
list_digits[1] * 10)]
else:
if list_digits[1] * 10 == 50:
self.output += "L"
elif list_digits[1] * 10 == 80:
self.output += "LXXX"
elif list_digits[1] * 10 == 70:
self.output += "LXX"
elif list_digits[1] * 10 == 60:
self.output += "LX"
elif list_digits[1] * 10 == 30:
self.output += "XXX"
elif list_digits[1] * 10 == 20:
self.output += "XX"
elif list_digits[1] * 10 == 10:
self.output += "X"
else:
self.output += ""
if self.numberlength == 1:
self.numberlength -= 1
if list_digits[0] == 4 or list_digits[0] == 9:
self.output += self.exceptionSymbols[self.position(
list_digits[0])]
elif list_digits[0] == 5:
self.output += "V"
elif list_digits[0] == 8:
self.output += "VIII"
elif list_digits[0] == 7:
self.output += "VII"
elif list_digits[0] == 6:
self.output += "VI"
elif list_digits[0] == 3:
self.output += "III"
elif list_digits[0] == 2:
self.output += "II"
elif list_digits[0] == 1:
self.output += "I"
else:
self.output += ""
return self.output
def position(self, symb):
counter = 0
while symb != self.exceptionValues[counter]:
counter += 1
return (counter)
def __init__(self) -> None:
self.exceptionValues = [4, 9, 40, 90, 400, 900]
self.exceptionSymbols = ["IV", "IX", "XL", "XC", "CD", "CM"]
#self.symbol = ['I', 'V', 'X', 'L', 'C', 'D', 'M']
#self.value = [1, 5, 10, 50, 100, 500, 1000]
self.output = ""
self.numberlength = 0
obj = Solution()
num = int(input("Enter an integer range(1,3999):"))
print(obj.intToRoman(num))
No comments:
Post a Comment