[LeetCode 13. Roman to Integer] Easy (19주차 5/10, 19/150)
Algorithm/LeetCode 문제 풀이 2019. 5. 12. 09:45class Solution:
def romanToInt(self, s: str) -> int:
sum = 0
for i in range(len(s)):
if(s[i]=='I'):
if(i + 1 < len(s) and (s[i+1] == 'V' or s[i+1] == 'X')):
sum -=1
else:
sum += 1
elif(s[i] == 'V'):
sum += 5
elif(s[i] == 'X'):
if(i + 1 < len(s) and (s[i+1] == 'C' or s[i+1] == 'L')):
sum -=10
else:
sum += 10
elif(s[i] == 'L'):
sum += 50
elif(s[i] == 'C'):
if(i + 1 < len(s) and (s[i+1] == 'M' or s[i+1] == 'D')):
sum -=100
else:
sum += 100
elif(s[i] == 'D'):
sum += 500
elif(s[i] == 'M'):
sum += 1000
print(sum)
return sum
'Algorithm > LeetCode 문제 풀이' 카테고리의 다른 글
[LeetCode 20. Valid Parentheses ] Easy (19주차 7/10, 21/150) (0) | 2019.05.12 |
---|---|
[LeetCode 14. Longest Common Prefix ] Easy (19주차 6/10, 20/150) (0) | 2019.05.12 |
[LeetCode 709. To Lower Case] Easy (19주차 4/10, 18/150) (0) | 2019.05.11 |
[LeetCode 1. Two Sum Easy] O(N^2) 로 풀었다.(19주차 3/10, 17/150) (0) | 2019.05.11 |
[LeetCode 344. Reverse String Easy] Python 자신감 뿜뿜 (0) | 2019.05.11 |