【LeetCode算法练习(C++)】Roman to Integer
来源:互联网 发布:淘宝双11销售额 编辑:程序博客网 时间:2024/06/13 07:34
题目:
Given a roman numeral, convert it to an integer.
Input is guaranteed to be within the range from 1 to 3999.
链接:Roman to Integer
解法:用数组存字母表示的数
class Solution { public: int romanToInt(string s) { int ans = 0, len = s.length(), val[255]; val['I'] = 1; val['V'] = 5; val['X'] = 10; val['L'] = 50; val['C'] = 100; val['D'] = 500; val['M'] = 1000; for (int i = 0; i < len; i++) { if (i > 0 && val[s[i]] > val[s[i - 1]]) { ans += val[s[i]] - 2 * val[s[i - 1]]; } else { ans += val[s[i]]; } } return ans; }};
Runtime: 119 ms
阅读全文
0 0
- 【LeetCode算法练习(C++)】Integer to Roman
- 【LeetCode算法练习(C++)】Roman to Integer
- Leetcode算法练习-easy篇-Roman to Integer
- 【LeetCode算法练习(C++)】String to Integer (atoi)
- leetcode系列(35)Roman to Integer & Integer to Roman
- LeetCode OJ算法题(十二):Integer to Roman
- LeetCode OJ算法题(十三):Roman to Integer
- LeetCode算法题之Roman to Integer
- 13. Roman to Integer leetcode算法笔记
- LeetCode算法题目: Integer to Roman
- LeetCode 13. Roman to Integer 题解(C++)
- LeetCode 12. Integer to Roman 题解(C++)
- [C++]LeetCode: 16 Roman to Integer
- [C++]LeetCode: 85 Integer to Roman
- C实现 LeetCode->Integer to Roman
- C实现 LeetCode->Roman to Integer
- 【leetcode c++】13 Roman to Integer
- [leetcode-13]Roman to Integer(C)
- 【mysql】事务 运行原理 概述
- 文章标题 coderforces 609E : Minimum spanning tree for each edge (MST+LCA)
- C语言基础数据类型与运算符号复习记录
- 弹出框
- 读书笔记-《Java NIO》:第三章 通道(4)
- 【LeetCode算法练习(C++)】Roman to Integer
- Xcode(8.3.3)编辑时闪退
- 3.1 栈及其基本应用
- C++中变量默认初始化规则
- PHP正则替换函数preg_replace和preg_replace_callback使用总结
- 4.聚合aggregate
- Intellij IDEA快捷键与使用技巧一览表
- Android延迟界面跳转的方法
- 最近工作不忙,捋一遍Java。