mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-22 17:22:04 +00:00
Code Issues Packages Projects Releases Wiki Activity

Update roman_numerals.py

Browse Source
This commit is contained in:
lighting9999 2025-02-10 17:53:35 +08:00 committed by GitHub
parent da299d48fe
commit ba43420897
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 9 additions and 35 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

44
conversions/roman_numerals.py
View File

@ -1,32 +1,11 @@
ROMAN = [
(1000000, "M_"),
(900000, "C_M_"),
(500000, "D_"),
(400000, "C_D_"),
(100000, "C_"),
(90000, "X_C_"),
(50000, "L_"),
(40000, "X_L_"),
(10000, "X_"),
(9000, "I_X_"),
(5000, "V_"),
(4000, "I_V_"),
(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"),
(1000000, "M_"), (900000, "C_M_"), (500000, "D_"), (400000, "C_D_"),
(100000, "C_"), (90000, "X_C_"), (50000, "L_"), (40000, "X_L_"),
(10000, "X_"), (9000, "I_X_"), (5000, "V_"), (4000, "I_V_"),
(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")
]
def roman_to_int(roman):
"""
Convert a Roman numeral to an integer, supporting Vinculum notation
@ -47,16 +26,13 @@ def roman_to_int(roman):
i, total = 0, 0
while i < len(roman):
# 先匹配 2 个字符的罗马数字（如 I_、X_）
if i + 1 < len(roman) and roman[i : i + 2] in vals:
total += vals[roman[i : i + 2]]
if i + 1 < len(roman) and roman[i:i+2] in vals:
total += vals[roman[i:i+2]]
i += 2
else:
total += vals[roman[i]]
i += 1
return total
def int_to_roman(number):
"""
Convert an integer to a Roman numeral, supporting Vinculum notation
@ -79,9 +55,7 @@ def int_to_roman(number):
if number == 0:
break
return "".join(result)
if __name__ == "__main__":
import doctest
doctest.testmod()