leetcode 13 :roman-to-integer

最新推荐文章于 2022-03-02 22:01:20 发布

红金龙-时光

最新推荐文章于 2022-03-02 22:01:20 发布

阅读量126

点赞数

分类专栏： leetcode Python

本文链接：https://blog.csdn.net/hongjinlongno1/article/details/85245168

版权

Python 同时被 2 个专栏收录

24 篇文章 0 订阅

订阅专栏

leetcode

16 篇文章 0 订阅

订阅专栏

思路很简单如果一个数小于后一个数那么取负
Runtime: 180 ms, faster than 50.44% of Python3 online submissions for Roman to Integer.

class Solution:
    def romanToInt(self, s):
        """
        :type s: str
        :rtype: int
        """
        dic = {'I':1,'V':5,'X':10,'L':50,'C':100,'D':500,'M':1000}
        sum = 0
        for i in range(len(s)):
            if (i < (len(s) -1)) and (dic[s[i]] < dic[s[i+1]]):
                dici =  - dic[s[i]]
            else:
                dici =  dic[s[i]]
            sum += dici
        return sum