DAY6：leetcode #13 Roman to Integer

最新推荐文章于 2016-12-02 12:09:42 发布

路人甲wttttt

最新推荐文章于 2016-12-02 12:09:42 发布

阅读量240

点赞数

分类专栏：算法文章标签： leetcode python

本文链接：https://blog.csdn.net/zcy19941015/article/details/51250577

版权

算法专栏收录该内容

76 篇文章 0 订阅

订阅专栏

Given a roman numeral, convert it to an integer.

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

class Solution(object):
    def romanToInt(self, s):
        """
        :type s: str
        :rtype: int
        """
        res = 0
        s = str(s)
        while len(s)>0:
            if s[:2] == 'CM':
                res += 900
                s = s[2:]
                continue
            elif s[:2] == 'XC':
                res += 90
                s = s[2:]
                continue
            elif s[:2] == 'IX':
                res += 9
                s = s[2:]
                continue
            elif s[:2] == 'CD':
                res += 400
                s = s[2:]
                continue
            elif s[:2] == 'XL':
                res += 40
                s = s[2:]
                continue
            elif s[:2] == 'IV':
                res += 4
                s = s[2:]
                continue
            elif s[0] == 'M':
                res += 1000
                s = s[1:]
                continue
            elif s[0] == 'D':
                res += 500
                s = s[1:]
                continue
            elif s[0] == 'C':
                res += 100
                s = s[1:]
                continue
            elif s[0] == 'L':
                res += 50
                s = s[1:]
                continue
            elif s[0] == 'X':
                res += 10
                s = s[1:]
                continue
            elif s[0] == 'V':
                res += 5
                s = s[1:]
                continue
            elif s[0] == 'I':
                res += 1
                s = s[1:]
                continue
        return res