LeetCode OJ: 12 Integer to Roman

最新推荐文章于 2017-08-15 14:37:18 发布

jxfang7788

最新推荐文章于 2017-08-15 14:37:18 发布

阅读量289

点赞数

分类专栏： OJ 文章标签： LeetCode OJ string

本文链接：https://blog.csdn.net/fjx1173865548/article/details/50935619

版权

OJ 专栏收录该内容

107 篇文章 0 订阅

订阅专栏

Total Accepted: 59069 Total Submissions: 155093 Difficulty: Medium

Given an integer, convert it to a roman numeral.

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

Submitted Code

Language：Python

class Solution(object):
    def intToRoman(self, num):
        """
        :type num: int
        :rtype: str
        """
        res = ''
        res += 'M' * (num // 1000)
        
        num %= 1000
        if num // 100 == 9:
            res += 'CM'
        if num // 100 < 9 and num // 100 >= 5:
            res += 'D' + 'C' * (num // 100 - 5)
        if num // 100 == 4:
            res += 'CD'
        if num // 100 < 4:
            res += 'C' * (num // 100)
            
        num %= 100
        if num // 10 == 9:
            res += 'XC'
        if num // 10 < 9 and num // 10 >= 5:
            res += 'L' + 'X' * (num // 10 - 5)
        if num // 10 == 4:
            res += 'XL'
        if num // 10 < 4:
            res += 'X' * (num // 10) 
            
        num %= 10
        if num == 9:
            res += 'IX'
        if num < 9 and num >= 5:
            res += 'V' + 'I' * (num - 5)
        if num == 4:
            res += 'IV'
        if num < 4:
            res += 'I' * num
            
        return res