leetCode练题——12. Integer to Roman

1、题目

12. Integer to Roman

Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M.

Symbol       Value

I             1

V             5

X             10

L             50

C             100

D             500

M             1000

For example, two is written as II in Roman numeral, just two one's added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

I can be placed before V (5) and X (10) to make 4 and 9.
X can be placed before L (50) and C (100) to make 40 and 90.
C can be placed before D (500) and M (1000) to make 400 and 900.

Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.

Example 1:

Input: 3

Output: "III"

Example 2:

Input: 4

Output: "IV"

Example 3:

Input: 9

Output: "IX"

Example 4:

Input: 58

Output: "LVIII"

Explanation: L = 50, V = 5, III = 3.

Example 5:

Input: 1994

Output: "MCMXCIV"

Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

2、我的解答（未简化）

 # -*- coding: utf-8 -*-

 # @Time    : 2020/1/30 19:14

 # @Author  : SmartCat0929

 # @Email   : 1027699719@qq.com

 # @Link    : https://github.com/SmartCat0929

 # @Site    :

 # @File    : 12. Integer to Roman(自己想的复杂的算法）.py

 class Solution:

     def intToRoman(self, num: int) -> str:

         numStr = str(num)

         if num < 10:

             if int(numStr[-1]) > 0 and int(numStr[-1]) < 4:

                 units = ""

                 for i in range(0, int(numStr[-1])):

                     units = "I" + units

             elif int(numStr[-1]) == 4:

                 units = "IV"

             elif int(numStr[-1]) == 5:

                 units = "V"

             elif int(numStr[-1]) > 5 and int(numStr[-1]) < 9:

                 units = "V"

                 for i in range(5, int(numStr[-1])):

                     units = units + "I"

             elif int(numStr[-1]) == 9:

                 units = "IX"

             return units

         elif num >= 10 and num <= 99:  # 如果是两位数

             if int(numStr[-1]) == 0:

                 units = ""

             elif int(numStr[-1]) > 0 and int(numStr[-1]) < 4:  # 个位

                 units = ""

                 for i in range(0, int(numStr[-1])):

                     units = "I" + units

             elif int(numStr[-1]) == 4:

                 units = "IV"

             elif int(numStr[-1]) == 5:

                 units = "V"

             elif int(numStr[-1]) > 5 and int(numStr[-1]) < 9:

                 units = "V"

                 for i in range(5, int(numStr[-1])):

                     units = units + "I"

             elif int(numStr[-1]) == 9:

                 units = "IX"

             if int(numStr[-2]) == 1:  # 十位

                 decades = "X"

             elif int(numStr[-2]) > 0 and int(numStr[-2]) < 4:  # 十位

                 decades = ""

                 for j in range(0, int(numStr[-2])):

                     decades = "X" + decades

             elif int(numStr[-2]) == 4:

                 decades = "XL"

             elif int(numStr[-2]) == 5:

                 decades = "L"

             elif int(numStr[-2]) > 5 and int(numStr[-2]) < 9:

                 decades = "L"

                 for j in range(5, int(numStr[-2])):

                     decades = decades + "X"

             elif int(numStr[-2]) == 9:

                 decades = "XC"

             romans = decades + units

             return romans

         elif num >= 100 and num <= 999:  # 如果是三位数

             if int(numStr[-1]) == 0:  # 个位

                 units = ""

             elif int(numStr[-1]) > 0 and int(numStr[-1]) < 4:

                 units = ""

                 for i in range(0, int(numStr[-1])):

                     units = "I" + units

             elif int(numStr[-1]) == 4:

                 units = "IV"

             elif int(numStr[-1]) == 5:

                 units = "V"

             elif int(numStr[-1]) > 5 and int(numStr[-1]) < 9:

                 units = "V"

                 for i in range(5, int(numStr[-1])):

                     units = units + "I"

             elif int(numStr[-1]) == 9:

                 units = "IX"

             if int(numStr[-2]) == 0:  # 十位

                 decades = ""

             elif int(numStr[-2]) > 0 and int(numStr[-2]) < 4:

                 decades = ""

                 for j in range(0, int(numStr[-2])):

                     decades = "X" + decades

             elif int(numStr[-2]) == 4:

                 decades = "XL"

             elif int(numStr[-2]) == 5:

                 decades = "L"

             elif int(numStr[-2]) > 5 and int(numStr[-2]) < 9:

                 decades = "L"

                 for j in range(5, int(numStr[-2])):

                     decades = decades + "X"

             elif int(numStr[-2]) == 9:

                 decades = "XC"

             if int(numStr[-3]) > 0 and int(numStr[-3]) < 4:  # 百位

                 hundreds = ""

                 for j in range(0, int(numStr[-3])):

                     hundreds = "C" + hundreds

             elif int(numStr[-3]) == 4:

                 hundreds = "CD"

             elif int(numStr[-3]) == 5:

                 hundreds = "D"

             elif int(numStr[-3]) > 5 and int(numStr[-3]) < 9:

                 hundreds = "D"

                 for j in range(5, int(numStr[-3])):

                     hundreds = hundreds + "C"

             elif int(numStr[-3]) == 9:

                 hundreds = "CM"

             romans = hundreds + decades + units

             return romans

         elif num >= 1000 and num <= 3999:  # 如果是四位数

             if int(numStr[-1]) == 0:  # 个位

                 units = ""

             elif int(numStr[-1]) > 0 and int(numStr[-1]) < 4:

                 units = ""

                 for i in range(0, int(numStr[-1])):

                     units = "I" + units

             elif int(numStr[-1]) == 4:

                 units = "IV"

             elif int(numStr[-1]) == 5:

                 units = "V"

             elif int(numStr[-1]) > 5 and int(numStr[-1]) < 9:

                 units = "V"

                 for i in range(5, int(numStr[-1])):

                     units = units + "I"

             elif int(numStr[-1]) == 9:

                 units = "IX"

             if int(numStr[-2]) == 0:  # 十位

                 decades = ""

             elif int(numStr[-2]) > 0 and int(numStr[-2]) < 4:

                 decades = ""

                 for j in range(0, int(numStr[-2])):

                     decades = "X" + decades

             elif int(numStr[-2]) == 4:

                 decades = "XL"

             elif int(numStr[-2]) == 5:

                 decades = "L"

             elif int(numStr[-2]) > 5 and int(numStr[-2]) < 9:

                 decades = "L"

                 for j in range(5, int(numStr[-2])):

                     decades = decades + "X"

             elif int(numStr[-2]) == 9:

                 decades = "XC"

             if int(numStr[-3]) == 0:  # 百位

                 hundreds = ""

             elif int(numStr[-3]) > 0 and int(numStr[-3]) < 4:

                 hundreds = ""

                 for j in range(0, int(numStr[-3])):

                     hundreds = "C" + hundreds

             elif int(numStr[-3]) == 4:

                 hundreds = "CD"

             elif int(numStr[-3]) == 5:

                 hundreds = "D"

             elif int(numStr[-3]) > 5 and int(numStr[-3]) < 9:

                 hundreds = "D"

                 for j in range(5, int(numStr[-3])):

                     hundreds = hundreds + "C"

             elif int(numStr[-3]) == 9:

                 hundreds = "CM"

             if int(numStr[-4]) > 0 and int(numStr[-4]) < 4: #千位

                 thousands = ""

                 for j in range(0, int(numStr[-4])):

                     thousands = "M" + thousands

                 romans = thousands + hundreds + decades + units

                 return romans

         elif num > 3999:

             return 0

 print(Solution().intToRoman(400))

3、大神的解法

LeetCode上看到的大神的解法，实在是佩服！采用字典将特殊符号记住，随后逐一判断.......

 class Solution:

     def intToRoman(self, num: int) -> str:

         res = ""

         s = 1000

         d = {1: "I", 5: "V", 10: "X", 50: "L", 100: "C", 500: "D", 1000: "M"}

         while num != 0:

             r, temp = divmod(num, s)

             if r == 9:

                 res += d[s] + d[s * 10]

             elif r == 4:

                 res += d[s] + d[s * 5]

             elif r >= 5:

                 res += d[s * 5] + d[s] * (r - 5)

             else:

                 res += d[s] * r

             s = s // 10

             num = temp

         return res

 print(Solution().intToRoman(2964))

leetCode练题——12. Integer to Roman的更多相关文章

Leetcode 12——Integer to Roman
12.Integer to Roman Given an integer, convert it to a roman numeral. Input is guaranteed to be withi ...
Leetcode 12. Integer to Roman(打表，水)
12. Integer to Roman Medium Roman numerals are represented by seven different symbols: I, V, X, L, C ...
乘风破浪：LeetCode真题_007_Reverse Integer
乘风破浪:LeetCode真题_007_Reverse Integer 一.前言这是一个比较简单的问题了,将整数翻转,主要考察了取整和取余,以及灵活地使用long型变量防止越界的问题. 二.Reve ...
《LeetBook》leetcode题解(12):Integer to Roman[M]
我现在在做一个叫<leetbook>的免费开源书项目,力求提供最易懂的中文思路,目前把解题思路都同步更新到gitbook上了,需要的同学可以去看看书的地址:https://hk029.g ...
【LeetCode】12. Integer to Roman (2 solutions)
Integer to Roman Given an integer, convert it to a roman numeral. Input is guaranteed to be within t ...
【算法】LeetCode算法题-Reverse Integer
这是悦乐书的第143次更新,第145篇原创 01 看题和准备今天介绍的是LeetCode算法题中Easy级别的第2题(顺位题号是7),给定32位有符号整数,然后将其反转输出.例如: 输入: 123 ...
leetCode练题——13. Roman to Integer
1.题目13. Roman to Integer Roman numerals are represented by seven different symbols: I, V, X, L, C, D ...
[LeetCode] 12. Integer to Roman 整数转化成罗马数字
Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 ...
【LeetCode】12. Integer to Roman 整数转罗马数字
作者: 负雪明烛 id: fuxuemingzhu 个人博客:http://fuxuemingzhu.cn/ 个人公众号:负雪明烛本文关键词:roman, 罗马数字,题解,leetcode, 力扣, ...

随机推荐

js变量提升的坑
关于js变量提升变量提升在js函数内部是可以直接修改全局的变量的,个人感觉是不好的设计, 但是确实存在这个概念原理: 先查看有没有函数变量bb 查看形参有没有bb 查看全局有没有bb 报错, 找 ...
EVE无法安装vim
有些时候,由于一些错误的操作,可能导致vim无法使用,例如如下情况: root@eve-ng:~# vim /etc/profile-bash: vim: command not found 此时,一 ...
多种语言输出helloworld
layuiAdmin std v1.x 【iframe版】开发者文档
layuiAdmin pro v1.x [单页版]开发者文档 layuiAdmin.std(iframe 版) 是完全基于 layui 架构而成的通用型后台管理模板系统,采用传统的 iframe 多页 ...
c# 异常:值不能为 null。参数名: source
异常详细信息: System.ArgumentNullException: 值不能为 null.参数名: source 其实问题那就出在 Select() 方法,在 Select 上按 F12 查看定 ...
在线直播： .NET与物联网主流技术探秘初识IoT！
DNT精英论坛暨.NET北京俱乐部是由资深.NET专家和社区活跃分子发起的技术论坛,以“分享.成长.合作.共赢”为原则,致力于打造一个领先的技术分享平台和成长交流生态.本次活动由aelf赞助支持,刘洪 ...
Nginx做缓存
查看服务 netstat -lntp|grep 80 Nginx作为缓存WEB服务通常情况下缓存是用来减少后端压力, 将压力尽可能的往前推, 减少后端压力,提高网站并发延时 Nginx代理缓存原理 ...
微信支付之H5支付
HoJe男孩子你要加油阿前言准备材料H5支付请求的参数返回结果统一下单回调接口用到的工具类886 . 前言大家好,分享是快乐的,也见证了个人成长历程,文章大多都是工作经验总结以及平时学习积累,基于 ...
Git创建合并和删除分支
创建并切换分支 git checkout命令加上-b参数表示创建并切换分支,以下为创建并切换到dev分支: 相当于先通过 $ git branch dev 命令创建dev分支,然后 $ git che ...
linux 自带php切换xampp
查看系统中有哪些用户: cut -d : -f 1 /etc/passwd 查看当前php: which php 删除系统自带php软链 rm -rf /usr/bin/php 切换到PHP新路径 l ...

leetCode练题——12. Integer to Roman

leetCode练题——12. Integer to Roman的更多相关文章

随机推荐

热门专题