Leetcode 13 - Roman to Integer
来源:互联网 发布:软件系统验收 编辑:程序博客网 时间:2024/06/07 19:59
Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
例子:遇到类似IV的数字,扫描到V时,发现V比I大,将最终结果加上V时,应当减去2倍的I。
class Solution {public: int romanToInt(string s) { int result = 0; for(int i=0;i<s.length();i++){ if(i>=1&&map(s[i-1])<map(s[i])){ result += map(s[i]) - 2*map(s[i-1]); }else{ result += map(s[i]); } } return result; }private:int map(const char c) { switch (c) { case 'I': return 1; case 'V': return 5; case 'X': return 10; case 'L': return 50; case 'C': return 100; case 'D': return 500; case 'M': return 1000; default: return 0; } }};
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-13Roman to Integer
- leetcode 13: Roman to Integer
- Leetcode 13 Roman to Integer
- 递归回溯
- 渐变色
- 寒假培训——简单搜索
- java如何创建xml文档
- Android 自定义捕获Application全局异常
- Leetcode 13 - Roman to Integer
- HTML/CSS基础回顾
- ios 关于自动布局Masonry学习小结
- Java中堆内存和栈内存详解(转)
- [leetcode oj 263]Ugly Number
- MFC学习(21)MFC打开/保存文件对话框——CFileDialog之二
- Unable to add window -- token null is not for an application
- eclipse快捷键 转载
- 产品详情页配送送信息联动的实现逻辑