Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Speedy category for Reverse Roman Numerals by YBurdin
ROMANS = {'I' : 1, 'V' : 5, 'X' : 10, 'L' : 50, 'C' : 100, 'D' : 500, 'M' : 1000}
def reverse_roman(roman_string):
decimal = [ROMANS[letter] for letter in roman_string]
for n in range(len(decimal)-1):
if decimal[n] < decimal[n+1]:
decimal[n] = -1*decimal[n]
return sum(decimal)
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert reverse_roman('VI') == 6, '6'
assert reverse_roman('LXXVI') == 76, '76'
assert reverse_roman('CDXCIX') == 499, '499'
assert reverse_roman('MMMDCCCLXXXVIII') == 3888, '3888'
print('Great! It is time to Check your code!');
Jan. 17, 2019
