1
1
ROMAN = [
2
- (1000000 , "M_" ), (900000 , "C_M_" ), (500000 , "D_" ), (400000 , "C_D_" ),
3
- (100000 , "C_" ), (90000 , "X_C_" ), (50000 , "L_" ), (40000 , "X_L_" ),
4
- (10000 , "X_" ), (9000 , "I_X_" ), (5000 , "V_" ), (4000 , "I_V_" ),
5
- (1000 , "M" ), (900 , "CM" ), (500 , "D" ), (400 , "CD" ),
6
- (100 , "C" ), (90 , "XC" ), (50 , "L" ), (40 , "XL" ),
7
- (10 , "X" ), (9 , "IX" ), (5 , "V" ), (4 , "IV" ), (1 , "I" )
2
+ (1000000 , "M_" ),
3
+ (900000 , "C_M_" ),
4
+ (500000 , "D_" ),
5
+ (400000 , "C_D_" ),
6
+ (100000 , "C_" ),
7
+ (90000 , "X_C_" ),
8
+ (50000 , "L_" ),
9
+ (40000 , "X_L_" ),
10
+ (10000 , "X_" ),
11
+ (9000 , "I_X_" ),
12
+ (5000 , "V_" ),
13
+ (4000 , "I_V_" ),
14
+ (1000 , "M" ),
15
+ (900 , "CM" ),
16
+ (500 , "D" ),
17
+ (400 , "CD" ),
18
+ (100 , "C" ),
19
+ (90 , "XC" ),
20
+ (50 , "L" ),
21
+ (40 , "XL" ),
22
+ (10 , "X" ),
23
+ (9 , "IX" ),
24
+ (5 , "V" ),
25
+ (4 , "IV" ),
26
+ (1 , "I" ),
8
27
]
28
+
29
+
9
30
def roman_to_int (roman ):
10
31
"""
11
32
Convert a Roman numeral to an integer, supporting Vinculum notation
@@ -27,13 +48,15 @@ def roman_to_int(roman):
27
48
i , total = 0 , 0
28
49
while i < len (roman ):
29
50
# 先匹配 2 个字符的罗马数字(如 I_、X_)
30
- if i + 1 < len (roman ) and roman [i : i + 2 ] in vals :
31
- total += vals [roman [i : i + 2 ]]
51
+ if i + 1 < len (roman ) and roman [i : i + 2 ] in vals :
52
+ total += vals [roman [i : i + 2 ]]
32
53
i += 2
33
54
else :
34
55
total += vals [roman [i ]]
35
56
i += 1
36
57
return total
58
+
59
+
37
60
def int_to_roman (number ):
38
61
"""
39
62
Convert an integer to a Roman numeral, supporting Vinculum notation
@@ -56,7 +79,9 @@ def int_to_roman(number):
56
79
if number == 0 :
57
80
break
58
81
return "" .join (result )
59
-
82
+
83
+
60
84
if __name__ == "__main__" :
61
85
import doctest
86
+
62
87
doctest .testmod ()
0 commit comments