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, 力扣, ...

随机推荐

SQL Server带列名导出到Excel(Export to CSV with headers)的几个思路
https://www.cnblogs.com/downmoon/archive/2012/05/04/2482995.html SQL Server 2008中SQL应用系列及BI学习笔记系列- ...
C 语言实现面向对象编程
转载 https://blog.csdn.net/onlyshi/article/details/81672279 C 语言实现面向对象编程1.引言面向对象编程(OOP)并不是一种特定的语言或者工具, ...
Googletest Primer
Googletest Primer 原文地址:https://github.com/google/googletest/blob/master/googletest/docs/primer.md In ...
stl队列
队列(Queue)也是一种运算受限的线性表,它的运算限制与栈不同,是两头都有限制,插入只能在表的一端进行(只进不出),而删除只能在表的另一端进行(只出不进),允许删除的一端称为队尾(rear),允许插 ...
yii2 password hash生成与验证方法
1.生成 $password是明文.如:123456 $this->password_hash = Yii::$app->security->generatePasswordHash ...
sublime-text3 安装 emmet 插件
下载sublime,http://www.sublimetext.com/ 安装package control :https://packagecontrol.io/ins... 这个地址需要翻墙,访 ...
hadoop学习笔记（七）：hadoop2.x的高可用HA（high avaliable）和联邦F(Federation)
Hadoop介绍——HA与联邦 0.1682019.06.04 13:30:55字数 820阅读 138 Hadoop 1.0中HDFS和MapReduce在高可用.扩展性等方面存在问题: –HDFS ...
django 模版查找路径
路径的配置,模版上下文的配置等.模版路径可以在两个地方配置. 1.'DIRS':这是一个列表,在这个列表中可以存放所有的模版路径,以后在视图中使用render或者render_to_string渲染模 ...
spring框架相关概念
软件行业的二八法则?技术中只有20%是最常用和最关键的,决定你的基础,后面的80%决定你的潜能! 概念: 1,轻量级框架,用户需要什么功能就自己添加相应的功能模块,不像重量级框架,一旦用,所有功能都添 ...
python+树莓派实现IoT（物联网）数据上传到服务器
环境:raspbian-stretch(2018-06-27) 树莓派:3代B型 1.树莓派设备,需要在野外也能拥有独立联网能力,那必不可少的需要使用物联网模块. 这里使用的是微雪的SIM868通讯模 ...

leetCode练题——12. Integer to Roman

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

随机推荐

热门专题