Leet Code OJ 13. Roman to Integer-python

题目：

13. Roman to Integer

Easy

24273630Add to ListShare

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.

 题意：

 将罗马数字转为普通数字。

思路：

从后往前扫描，如果遇到比当前罗马数字小的，则减去前一个数字。

我的处理：

1.将字符串翻转

2.从前往后处理

3.如果下一个字符比当前字符小，则减去下一个字符，同时将指针往后移一位。

代码：

1.枚举，一个一个处理

class Solution(object):
    def romanToInt(self, s):
        """
        :type s: str
        :rtype: int
        """
        i = 0
        num = 0
        s = s[::-1]
        print(s)
        while i<len(s):
            if s[i]=='I':
                num+=1
            if s[i]=='V':
                if i+1<len(s) and s[i+1]=='I':
                    num+=4
                    i = i+1
                else:
                    num+=5
                    
            if s[i]=='X':
                if i+1<len(s) and s[i+1]=='I':
                    num+=9
                    i = i+1
                else:
                    num+=10
                    
            if s[i]=='L':
                if i+1<len(s) and s[i+1]=='X':
                    num+=40
                    i = i+1
                else:
                    num+=50
                    
            if s[i]=='C':
                if i+1<len(s) and s[i+1]=='X':
                    num+=90
                    i = i+1
                else:
                    num+=100
                    
            if s[i]=='D':
                if i+1<len(s) and s[i+1]=='C':
                    num+=400
                    i = i+1
                else:
                    num+=500
            if s[i]=='M':
                if i+1<len(s) and s[i+1]=='C':
                    num+=900
                    i = i+1
                else:
                    num+=1000
            i = i+1
        return num

2.优化处理

class Solution(object):
    def romanToInt(self, s):
        """
        :type s: str
        :rtype: int
        """
        i = 0
        num = 0
        s = s[::-1]
        digits = {"I":1, "V":5, "X":10, "L":50, "C":100, "D":500, "M":1000}
        while i<len(s):
            if i+1<len(s) and digits[s[i]]>digits[s[i+1]]:
                num = num+digits[s[i]]-digits[s[i+1]]
                i=i+1
            else:
                num+=digits[s[i]]
            i=i+1
        return num