leetcode Roman to integer
来源:互联网 发布:小学生手游数据 编辑:程序博客网 时间:2024/05/16 07:32
题目:
Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
要把罗马数字转换为整数, 罗马数字自行百度
code:
class Solution{ public: int romanToInt(string s) { map<char,int> Roman; Roman['I'] = 1; Roman['V'] = 5; Roman['X'] =10; Roman['L'] =50; Roman['C'] =100; Roman['D'] =500; Roman['M'] =1000; int i=s.length()-1; int res; while(i>=0) { if(i==s.length()-1) { res=Roman[s[i]]; i--; } if(Roman[s[i]] >= Roman[s[i+1]]) res=res+Roman[s[i]]; else res=res-Roman[s[i]]; i--; } return res; }};
0 0
- 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
- LeetCode Integer to Roman & Roman to Integer
- leetcode - roman to integer & integer to roman
- LeetCode:Roman to Integer
- LeetCode: Integer to Roman
- LeetCode: Roman to Integer
- LeetCode Integer to Roman
- LeetCode: Integer to Roman
- LeetCode : Roman to Integer
- [Leetcode] Roman to Integer
- [Leetcode] Integer to Roman
- Leetcode: Integer to Roman
- Leetcode: Roman to Integer
- LeetCode Integer to Roman
- 【leetcode】Roman to Integer
- CALayer的使用
- sun.misc.BASE64Encoder找不到包,解决方法
- 杭电 hdu 2544 最短路 (最短路径 + Dijkstra算法)
- 用gradle编译任意结构的Android项目
- 三星S5PV210(ARM-Cortex A8)中断过程图解
- leetcode Roman to integer
- 转方阵
- 抽象类与接口学习小结
- 【LDA】动手实现LDA
- dismissViewController实现多个模态视图跳转
- jsp页面导出功能,ajax异步导出,友好提示
- Linux的SOCKET编程详解
- 求一个二叉搜索树中第K个最小值
- 轮换