【leetcode】整数转罗马数字、罗马数字转整数【Python】

题目链接

递归算法，需要注意40~50的情况特殊性

class Solution(object):
    def intToRoman(self, num):
        if num == 0: return ''
        if num == 4: return 'IV'
        if num == 9: return 'IX'
        if num == 40: return 'XL'
        if num == 90: return 'XC'
        if num == 400: return 'CD'
        if num == 900: return 'CM'
        if num >= 1 and num <= 3:
            return 'I' * num
        if num >= 5 and num <= 8:
            return 'V' + self.intToRoman(num - 5)
        if num >= 10 and num <= 39:
            m = (