leetcode--12. Integer to Roman
来源:互联网 发布:永磁旋振治疗仪淘宝 编辑:程序博客网 时间:2024/06/18 04:27
题目:12. Integer to Roman
链接:https://leetcode.com/problems/integer-to-roman/description/
将给定的阿拉伯数字转成罗马数字。
class Solution(object): romanDict = [("I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX", ""), ("X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC", ""), ("C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM", ""), ("M", "MM", "MMM", "", "", "", "", "", "")] def intToRoman(self, num): """ :type num: int :rtype: str """ if not str(num): return "" return self.romanDict[len(str(num))-1][int(str(num)[0])-1]+self.intToRoman(str(num)[1:len(str(num))])
阅读全文
0 0
- LeetCode 12. Integer to Roman
- [LeetCode]12.Integer to Roman
- LeetCode --- 12. Integer to Roman
- [Leetcode] 12. Integer to Roman
- [leetcode] 12.Integer to Roman
- leetcode 12. Integer to Roman
- leetcode 12. Integer to Roman
- [LeetCode]12. Integer to Roman
- leetcode 12. Integer to Roman
- LeetCode *** 12. Integer to Roman
- LeetCode 12. Integer to Roman
- leetcode 12. Integer to Roman
- leetcode 12. Integer to Roman
- Leetcode 12. Integer to Roman
- [Leetcode] 12. Integer to Roman
- leetcode 12. Integer to Roman
- 【leetcode】12. Integer to Roman
- Leetcode-12. Integer to Roman
- Java进制概述及进制间的相互转换
- 计算机视觉(ComputerVision, CV)相关领域牛人的网站链接
- 读书笔记 2017年11月28日
- SpringMVC自定义注解进行日期校验
- 面试杂记1
- leetcode--12. Integer to Roman
- IO多路复用之select、poll、epoll详解
- C语言
- Linux如何查看JDK的安装路径
- shell脚本中写sftp
- 数据结构--无序List
- js为假的判断
- JAVA多线程实现的三种方式
- 【数据结构作业六b】建立一个二叉排序树,根据给定的定值对其实施查找