首页 > itarticle > leetcode解题-integer to roman

leetcode解题-integer to roman

admin 11月 11, 2020 0

描述

Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.

分析

要考虑罗马数字的加法规则和减法规则，要写对还是有一定技巧的，下面是一个精巧的解法。

代码

Python

class (object):
    def intToRoman(self, num):
        """
        :type num: int
        :rtype: str
        """
        romans = [
            ('M', 1000),
            ('CM', 900),
            ('D', 500),
            ('CD', 400),
            ('C', 100),
            ('XC', 90),
            ('L', 50),
            ('XL', 40),
            ('X', 10),
            ('IX', 9),
            ('V', 5),
            ('IV', 4),
            ('I', 1)
        ]
        rs = []
        for s, n in romans:
            c, num = divmod(num, n)
            rs.extend([s] * c)
        return ''.join(rs)