leetcode python3 整数转罗马数字

一、自己思路

1.思路：将数字分解成千位数、百位数、个位数，对不同的位数中分3个阶段进行讨论 ==9的、5-8之间的、==4的、1-3之间的。对于不同的分位数和阶段加上不同的符号处理：

2.代码

class Solution:
    def intToRoman(self, num):
        str=""
        if int(num/1000)>0:
            for i in range(int(num/1000)):
                str+='M'
            num=int(num%1000)
        if int(num/100)>0:
            if int(num/100)==9:
                str+='CM'
            elif int(num/100)>4 and int(num/100)<9:
                str+='D'
                for i in range(int(num/100)-5):
                    str+='C'
            elif int(num/100)==4:
                str+='CD'
            else:
                for i in range(int(num/100)):
                    str+='C'
            num=int(num%100)
        if int(num/10)>0:
            if int(num/10)==9:
                str+='XC'
            elif int(num/10)>4 and int(num/10)<9:
                str+='L'
                for i in range(int(num/10)-5):
                    str+='X'
            elif int(num/10)==4:
                str+='XL'
            else:
                for i in range(int(num/10)):
                    str+='X'
            num=int(num%10)
        if num>0:
            if num==9:
                str+='IX'
            elif num>4 and num<9:
                str+='V'
                for i in range(num-5):
                    str+='I'
            elif num==4:
                str+='IV'
            else:
                for i in range(num):
                    str+='I'
        return str
            

二、穷举法思路

1.思路：穷举各个分位数上的1-9的表示方法，直接求余数即可

2.代码

def intToRoman(self, num):】
        dic_1=['','I','II','III','IV','V','VI','VII','VIII','IX']
        dic_10 = ['', 'X','XX',  'XXX','XL','L','LX', 'LXX','LXXX','XC']
        dic_100 = ['','C', 'CC',  'CCC', 'CD', 'D','DC',  'DCC', 'DCCC', 'CM',]
        dic_1000 = ['','M','MM','MMM']
        res = ''
        res = dic_1000[num//1000]+dic_100[(num%1000)//100]+\
                 dic_10[(num%100)//10]+dic_1[num%10]
        return res

三、高级思路

1.思路：将数字区间列出来，找到数字在的区间，然后取区间的低位数，并将数字减去低位数区间，在进一步查找，

2.代码

class Solution(object):
    def intToRoman(self, num):
        if num > 3999 or num < 1:
            return 0
        # 字典是无序的，所以不使用字典
        # 注意这里一定要是倒序，否则执行会有问题，让数从大往小查找适合的罗马数
        num_tuple = [1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1]
        roman_tuple = ['M', 'CM', 'D', 'CD', 'C', 'XC', 'L', 'XL', 'X', 'IX', 'V', 'IV', 'I']
        # 记录结果的字符串
        result_str = ""
        # 从整数的列表中开始遍历
        for i in range(len(num_tuple)):
            # 从大往小开始判断，num小于当前数则进行下一次循环
            # num大于当前数则进行减法运算，并取出相应位置的Roman数
            while num >= num_tuple[i]:
                num -= num_tuple[i]
                result_str += roman_tuple[i]
        return result_str


if __name__ == '__main__':
    s = Solution()
    print(s.intToRoman(58))

（--------------------- 
作者：华软小白 
来源：CSDN 
原文：https://blog.csdn.net/chenhua1125/article/details/80516696 
版权声明：本文为博主原创文章，转载请附上博文链接！）