一.罗马数字转数字
法一:和左边的数字比:
class Solution:
def romanToInt(self,s):
numeral_map = {"I":1,"V":5,"X":10,"L":50,"C":100,"D":500,"M":1000}
result = 0
for i in range(len(s)):#range(7),则输出0123456
if i>0 and numeral_map[s[i]]>numeral_map[s[i-1]]:
result += numeral_map[s[i]]-2*numeral_map[s[i-1]]
else:
result += numeral_map[s[i]]
return result
法二:和右边的数字比:
class Solution:
def romanToInt(self, s: str) -> int:
map = {'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000,'CM':900,'CD':400,'XC':90,'XL':40,'IX':9,'IV':4,}
output = 0
lens = len(s)
if 1 <= len(s) <= 15:
for i in range(lens-1):
if map[s[i]] >=map[s[i+1]]:
output+=map[s[i]]
else:
if (s[i]+s[i+1]) in map:
output -= map[s[i]]
else:
return '请输入符合规则的罗马数字'
output+=map[s[-1]]#加最后一个数
else:
print('请输入长度小于等于15的罗马数字')
return output
s = "MCMXCIV"
print(Solution().romanToInt(s))
解析:
‘’’
A.注意:罗马数字的组合只有这几种,有CM但没有MC。
1.小数在大数右边
2.除了I罗马数字以外,其他罗马数字之间只有减法,没有加法
3.I罗马数字的加法,由于罗马数字要求的有效性,则只需在最后不断叠加就好
[(1000,“M”),(900,“CM”),(500,“D”),(400,“CD”),
(100,“C”),(90,“XC”),(50,“L”),(40,“XL”),
(10,“X”),(9,“IX”),(5,“V”),(4,“IV”),(1,“I”)]
为了在连贯的罗马数字中识别出这这些罗马数字,就需要下面这两个规则
//如果只有加法,则直接选择加法。
//如果有加法还有减法,则直接选择减法。
来实现只做字母之间相减的功能,然后最后的数字I可以相加,因为他后面就没有数字了,可以做相加功能。
B.此题还用到了字典!
‘’’
二.数字转罗马数字
class Solution:
def intToRoman(self, num: int) -> str:
int_to_roman = [(1000,"M"),(900,"CM"),(500,"D"),(400,"CD"),
(100,"C"),(90,"XC"),(50,"L"),(40,"XL"),
(10,"X"),(9,"IX"),(5,"V"),(4,"IV"),(1,"I")]
#用来保存整数转罗马数字的信息
roman_num = ""
for number,roman in int_to_roman:
#用来保存整数和余数部分
#整数表示重复的次数
count,num = divmod(num,number)
roman_num += roman * count
#当余数为0时结束循环
if num == 0:
break
return roman_num
原文链接:https://blog.csdn.net/sinat_29957455/article/details/112059042