zoukankan      html  css  js  c++  java
  • Leetcode 12. Integer to Roman

    Description: 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, 2 is written as II in Roman numeral, just two one's added together. 12 is written as XII, which is simply X + II. The number 27 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.

    Link: 12. Integer to Roman

    Examples:

    Example 1:
    Input: num = 3
    Output: "III"
    
    Example 2:
    Input: num = 4
    Output: "IV"
    
    Example 3:
    Input: num = 9
    Output: "IX"
    
    Example 4:
    Input: num = 58
    Output: "LVIII"
    Explanation: L = 50, V = 5, III = 3.
    
    Example 5:
    Input: num = 1994
    Output: "MCMXCIV"
    Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

    思路: 直接取每一位的值,然后替换。

    class Solution(object):
        def intToRoman(self, num):
            """
            :type num: int
            :rtype: str
            """
            roman = {0: 'IVX', 1: 'XLC', 2: 'CDM', 3: 'MMM'}
            ans = ''
            for i, n in enumerate(str(num)):
                ans += self.replaceroman(len(str(num))-1-i, int(n), roman)
            return ans
                    
        def replaceroman(self, digit, n, roman):
            I = roman[digit][0]
            V = roman[digit][1]
            X = roman[digit][2]
            if n < 4:
                ans = I*n
            elif n == 4:
                ans = I+V
            elif n == 5:
                ans = V
            elif n < 9:
                ans = V+I*(n-5)
            else:
                ans = I+X
            return ans

    日期: 2021-03-27

  • 相关阅读:
    verilog编码规范
    verilog代码 想法验证---与寄存器输出有关
    MMCM与PLL
    Vivado约束文件(XDC)的探究(2)
    Vivado约束文件(XDC)的探究(1)
    VGA图像显示组成模块分析
    关于Quad PLL /CPLL参考时钟的选择
    GTX的生成(包括COMMON)
    SD-SDI播出系统---使用GTX TX产生恢复时钟
    DRP端口描述
  • 原文地址:https://www.cnblogs.com/wangyuxia/p/14585810.html
Copyright © 2011-2022 走看看