您的位置:首页 > 其它

DAY6:leetcode #13 Roman to Integer

2016-04-26 15:03 169 查看
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
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: