LeetCode | 13. Roman to Integer
来源:互联网 发布:pe系统制作软件 编辑:程序博客网 时间:2024/06/05 19:42
Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
class Solution {public: int romanToInt(string s) { int res = 0, len = s.length(); map<char, int> hash; hash.insert(make_pair('I', 1)); hash.insert(make_pair('V',5)); hash.insert(make_pair('X',10)); hash.insert(make_pair('L',50)); hash.insert(make_pair('C',100)); hash.insert(make_pair('D',500)); hash.insert(make_pair('M',1000)); map<char, int>::iterator it1, it2; res = hash[s[len-1]]; for(int i=len-2;i>=0;i--) { it1 = hash.find(s[i]); it2 = hash.find(s[i+1]); if(it1->second < it2->second) res -= it1->second; else res += it1->second; } return res; }};
1 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
- Minimum Time Difference
- Android ScrollView指定view的悬停
- 7种结构型模式之:适配器模式(Adapter):类适配器、对象适配器
- Java dos命令窗口获取方法的签名
- 手写Tomca之深度解析动态资源请求原理
- LeetCode | 13. Roman to Integer
- 欢迎使用CSDN-markdown编辑器
- 当应用程序不是以UserInteractive模式运行
- windows下php操作MySQL
- 扫一扫——Zxing
- 经典排序算法
- 如何使用gdb快速attach到所需进程上
- Java-Reflect反射
- 正则黑名单高级爬虫系统