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.
第一遍：
Test Case "III" Pass.
Test case s="MCMXCIV",failed. expect 1994 ,actually get 1794.

如果用到index需要考虑返回的是第一个值的下标。

find() 方法检测字符串中是否包含子字符串 str ，如果指定 beg（开始） 和 end（结束） 范围，则检查是否包含在指定范围内，如果指定范围内如果包含指定索引值，返回的是索引值在字符串中的起始位置。如果不包含索引值，返回-1。

http://www.runoob.com/python3/python3-string-find.html

index() 方法检测字符串中是否包含子字符串 str ，如果指定 beg（开始） 和 end（结束） 范围，则检查是否包含在指定范围内，该方法与 python find()方法一样，只不过如果str不在 string中会报一个异常。

http://www.runoob.com/python3/python3-string-index.html

 

class Solution:
    def romanToInt(self, s):
        """
        :type s: str
        :rtype: int
        """
        s="MCMXCIV"  <===Test Case fail :expect:1994,actually 1794; s="III",pass
        dicta={'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}
        sum=0
        for i in s:
            if s.index(i)+1 < len(s):              
                if dicta[s[s.index(i)+1]] > dicta[s[s.index(i)]]:
                    print("dicta[s[s.index(i)+1]] is ",dicta[s[s.index(i)+1]])
                    sum=sum-dicta[i]
                    print("if sum is ",sum)
                else:
                    sum=sum+dicta[i]
                    print("else i is ",i)
                    print("else sum is ",sum)
        sum=sum+dicta[s[-1]]
            
        return sum


def stringToString(input):
    import json

    return json.loads(input)

def main():
    import sys
    import io
    def readlines():
        for line in io.TextIOWrapper(sys.stdin.buffer, encoding='utf-8'):
            yield line.strip('\n')

    lines = readlines()
    while True:
        try:
            line = next(lines)
            s = stringToString(line);
            
            ret = Solution().romanToInt(s)

            out = str(ret);
            print(out)
        except StopIteration:
            break

if __name__ == '__main__':
    main()

第二遍： 

Test Case "III" failed. Expect 3, actually get 2.

Test Case s="MCMXCIV",PASS.

class Solution:
    def romanToInt(self, s):
        """
        :type s: str
        :rtype: int
        """
       # s="III" # PASS
       # s="MCMXCIV" #PASS
       # s="D" #PASS
        dicta={'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}
        sum=0
        i=0
        while i < len(s)-1:
                if int(dicta[s[i]]) >= int(dicta[s[i+1]]):
                    sum+=int(dicta[s[i]])
                    i+=1
                elif int(dicta[s[i]]) < int(dicta[s[i+1]]):
                    sum=sum+int(dicta[s[i+1]])-int(dicta[s[i]])
                    i+=2  
        #后面的两个if加上后，代码是可以通过目前所有的test case.
        if len(s) >= 2:
            if dicta[s[-2]] >= dicta[s[-1]]:
              sum+=dicta[s[-1]]
        if len(s)==1:
            sum+=dicta[s[0]]               
        return sum

def stringToString(input):
    import json

    return json.loads(input)

def main():
    import sys
    import io
    def readlines():
        for line in io.TextIOWrapper(sys.stdin.buffer, encoding='utf-8'):
            yield line.strip('\n')

    lines = readlines()
    while True:
        try:
            line = next(lines)
            s = stringToString(line);
            
            ret = Solution().romanToInt(s)

            out = str(ret);
            print(out)
        except StopIteration:
            break

if __name__ == '__main__':
    main()

第三遍：

可以试试再while 下加个判断if dicta[s[-2]]和倒数第一个值的关系。再做其他运算。