Roman to Integer
来源：互联网 发布：隔热断桥铝合金 知乎 编辑：程序博客网 时间：2024/06/08 15:43
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) { unordered_map<char, int> m{{'I', 1}, {'V', 5}, {'X', 10}, {'L', 50}, {'C', 100}, {'D', 500}, {'M', 1000}}; int res = 0; for(int i = 0 ; i< s.size();++i){ int val = m[s[i]]; if(i==s.size()-1||m[s[i]]>=m[s[i+1]]) res+=val; else res-=val; } return res; }}; 0 0
- Integer to Roman & Roman to Integer
- Integer to Roman & Roman to Integer
- LeetCode Roman to Integer && Integer to Roman
- 【leetcode】Roman to Integer | Integer to Roman
- Leetcode - "Roman to Integer" & "Integer to Roman"
- LeetCode:Roman to Integer,Integer to Roman
- Integer to Roman and Roman to Integer
- LeetCode Integer to Roman & Roman to Integer
- Roman to Integer/Integer to Roman
- leetcode - roman to integer & integer to roman
- "Roman to Integer" and "Integer to Roman"
- Roman to Integer &&Integer to Roman
- Roman to Integer and Integer to Roman
- Roman to Integer/Integer to Roman
- LeetCode:Roman to Integer
- LeetCode: Integer to Roman
- LeetCode: Roman to Integer
- LeetCode Integer to Roman
- php使用Elasticsearch-api之update_by_query操作
- 2017携程后端开发实习生招聘笔试
- 线性判别分析LDA
- 小文件合并存储问题
- IP协议的相关技术
- Roman to Integer
- [C++基础]指针函数与函数指针<详细讲解>
- 笔试面试算法经典--判断二叉树是否是平衡二叉树（Java）
- 一种利用重链剖分优化一类树形动态规划空间复杂度的方法
- Jack-server出错：out of memory error，try increasing heap size
- Linux 下使用awk处理数据并写入数据库
- 排序算法之插入排序
- 不可重复读和幻读的一些区别
- 数组之sort Array中，找出给定数字出现的次数
