leetcode: 13. Roman to Integer
来源：互联网 发布：小说淘宝网免费阅读 编辑：程序博客网 时间：2024/05/29 03:44
Problem
# Given a roman numeral, convert it to an integer.## Input is guaranteed to be within the range from 1 to 3999.AC
class Solution(): def romanToInt(self, x): roman = {"I":1, "V":5, "X":10, "L":50, "C":100, "D":500, "M":1000} sum = 0 for i in range(len(x) - 1): sum += roman[x[i]] if roman[x[i]] >= roman[x[i+1]] else -roman[x[i]] return sum + roman[x[-1]]if __name__ == "__main__": assert Solution().romanToInt("IIVX") == 5 assert Solution().romanToInt("MMMCMXCIX") == 3999阅读全文
0 0
- LeetCode 13. Roman to Integer
- [LeetCode]13.Roman to Integer
- LeetCode --- 13. Roman to Integer
- [Leetcode] 13. Roman to Integer
- [leetcode] 13.Roman to Integer
- leetcode 13. Roman to Integer
- leetcode 13. Roman to Integer
- LeetCode 13. Roman to Integer
- [LeetCode]13. Roman to Integer
- Leetcode 13. Roman to Integer
- leetcode 13. Roman to Integer
- leetcode 13. Roman to Integer
- LeetCode *** 13. Roman to Integer
- LeetCode 13. Roman to Integer
- LeetCode 13. Roman to Integer
- 【LeetCode】13. Roman to Integer
- Leetcode 13. Roman to Integer
- LeetCode 13. Roman to Integer
- AndroidStudio gradle配置
- Vue.js学习笔记（一）
- 使用BeautifulSoup爬取“0dayin”网站的资源
- CentOS 6.6安装以mysql
- DLL导出函数示例
- leetcode: 13. Roman to Integer
- 6-19 Count Connected Components（20 point(s)）
- 【Ionic2】Ionic2 踩坑记录
- springboot+Thymeleaf demo 每天进步百分之一
- 高企利润成诱人蛋糕，火热现金贷背后暗藏“暴利”风险
- Android 中ViewPager自适应图片高度的问题
- C++继承中关于子类构造函数
- 11.07 学习心得
- 注解 整理
