首页 > 编程语言 > 详细

[leetcode]Integer to Roman @ Python

时间:2014-06-10 17:05:47      阅读:245      评论:0      收藏:0      [点我收藏+]

原题地址:https://oj.leetcode.com/problems/integer-to-roman/

题意:

Given an integer, convert it to a roman numeral.

Input is guaranteed to be within the range from 1 to 3999.

解题思路:整数(1~3999)到罗马数字的转换。字母前置表示减法,例如CM表示M-C=1000-100=900,XL表示L-X=50-10=40。

代码:

bubuko.com,布布扣
class Solution:
    # @return a string
    def intToRoman(self, num):
        values = [ 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 ]
        numerals = [ "M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I" ]
        list = ‘‘
        for i in range(0, len(values)):
            while num >= values[i]:
                num -= values[i]
                list += numerals[i]
        return list
bubuko.com,布布扣

 

[leetcode]Integer to Roman @ Python,布布扣,bubuko.com

[leetcode]Integer to Roman @ Python

原文:http://www.cnblogs.com/zuoyuan/p/3779581.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!