-
Notifications
You must be signed in to change notification settings - Fork 0
/
integer-to-roman.py
84 lines (70 loc) · 3.43 KB
/
integer-to-roman.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
# 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.
class Solution(object):
roman_integer=[1,5,10,50,100,500,1000]
result=''
global_num=0
def intToRoman(self, num):
"""
:type num: int
:rtype: str
"""
self.global_num=num
return self.computeRomanLiteral(num,6)
def computeRomanLiteral(self,num,index):
#print(num)
if(num<=0):
return self.result
current_roman_integer=self.roman_integer[index]
if(num//current_roman_integer==0):
return self.computeRomanLiteral(num,index-1)
else:
quotient=(int)(num/current_roman_integer)
if(index<6):
next_roman_integer=self.roman_integer[index+1]
# check if substraction is possible
subtracted_literal=self.getSubtractedRomanLiterals(index,num)
if(index<6 and subtracted_literal != ''):
self.result=self.result+subtracted_literal
else:
self.global_num=self.global_num-quotient*current_roman_integer
self.result=self.result+quotient*self.getRomanLiteral(current_roman_integer)
#print(self.result)
return self.computeRomanLiteral(self.global_num,index-1)
def getSubtractedRomanLiterals(self,index,num):
if(index<0 or index==6):
return ''
#print('number: {0},index: {1}'.format(num,index))
use_c=self.roman_integer[index+1]-self.roman_integer[index]
use_p=self.roman_integer[index+1]-self.roman_integer[index-1]
if(use_p>num):
return ''
elif((num-use_p<use_c and index-1>0) or num==use_p):
#print(use_p)
self.global_num=num-use_p
return self.getRomanLiteral(self.roman_integer[index-1])+self.getRomanLiteral(self.roman_integer[index+1])
elif((num-use_p>use_c and use_p>0)or num==use_c):
#print(use_c)
self.global_num=num-use_c
return self.getRomanLiteral(self.roman_integer[index])+self.getRomanLiteral(self.roman_integer[index+1])
return '';
def getRomanLiteral(self,num):
roman_dict={'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}
for literal, number in roman_dict.items():
if(num==number):
return literal
test=Solution()
print(test.intToRoman(42))