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

    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 a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.

    Example 1:

    Input: "III"
    Output: 3

    Example 2:

    Input: "IV"
    Output: 4

    Example 3:

    Input: "IX"
    Output: 9

    Example 4:

    Input: "LVIII"
    Output: 58
    Explanation: L = 50, V= 5, III = 3.

    Example 5:

    Input: "MCMXCIV"
    Output: 1994
    Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.

    class Solution:
        def romanToInt(self, s):
            """
            :type s: str
            :rtype: int
            """
            dict = {'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}
            res = 0
            if len(s)==0:
                return res
            for i in range(len(s)):
                if i<len(s)-1:
                    if dict[s[i]]<dict[s[i+1]]:
                        res -= dict[s[i]]
                        continue
                res += dict[s[i]]
            return res
    
  • 相关阅读:
    mysql共享锁与排他锁
    脏读、幻读、不可重复读和丢失更新
    数据库事务原理及并发、死锁
    漫谈php框架之中间件
    [PHP]用户登陆中间件
    POJ 1753 Flip Game (状态压缩 bfs+位运算)
    CSU
    CSU
    CodeForces
    CSU 1726: 你经历过绝望吗?两次!(bfs+优先队列)
  • 原文地址:https://www.cnblogs.com/bernieloveslife/p/9754695.html
Copyright © 2011-2022 走看看