12 leetcode - Integer to Roman

最新推荐文章于 2025-08-09 17:01:50 发布

原创最新推荐文章于 2025-08-09 17:01:50 发布 · 238 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #数字变罗马数字

算法专栏收录该内容

84 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的算法实现，适用于1到3999范围内的整数转换。该算法通过建立数值与罗马数字之间的映射关系，实现了高效的转换过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#!/usr/bin/python
# -*- coding: utf-8 -*-
'''
英文:Integer to Roman,Input is guaranteed to be within the range from 1 to 3999.
中文:整数变为罗马数字，范围1~3999
'''
class Solution(object):
    def intToRoman(self, num):
        """
        :type num: int
        :rtype: str
        """
        a = ["I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX",
             "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC",
             "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM",
             "M", "MM", "MMM"]
        b = range(1,10) + range(10,100,10) + range(100,1000,100) + [1000,2000,3000]
        d = dict(zip(b,a))
        ret = []
        times = 1
        while num:
            cnt = (num %10)*times
            if d.has_key(cnt):
                ret.append(d[cnt])
            num /= 10
            times *= 10
        return ''.join(reversed(ret))

if __name__ == "__main__":
    s = Solution()
    print s.intToRoman(1)