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

Update roman_numerals.py

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

8
conversions/roman_numerals.py
View File

@ -8,8 +8,8 @@ ROMAN = [
]
def roman_to_int(roman: str) -> int:
"""
Convert a Roman numeral to an integer, supporting Vinculum notation (underscore _ represents 1000 times).
LeetCode No. 13 Roman to Integer
Convert a Roman numeral to an integer, supporting Vinculum notation (underscore _ represents 1000 times).
LeetCode No. 13 Roman to Integer
​    Given a roman numeral, convert it to an integer.
​    Input is guaranteed to be within the range from 1 to 3999.
​    https://en.wikipedia.org/wiki/Roman_numerals
@ -31,7 +31,7 @@ def roman_to_int(roman: str) -> int:
total += vals[roman[i]]
i += 1
return total
def int_to_roman(number: int) -> str:
def int_to_roman(number: int) -> str:
"""
Convert an integer to a Roman numeral, supporting Vinculum notation (underscore _ represents 1000 times).
 Given a integer, convert it to an roman numeral.
@ -48,7 +48,7 @@ def roman_to_int(roman: str) -> int:
factor, number = divmod(number, arabic)
result.append(roman * factor)
if number == 0:
reak
break
return "".join(result)
if __name__ == "__main__":