leetcode 13 Roman to Integer C++
来源：互联网 发布：淘宝童鞋运动少女 编辑：程序博客网 时间：2024/06/05 04:01
这道题主要是要知道罗马转数字的规则，前边的比后边的小就要减。
int romanToInt(string s) { int a[26] = {0}; a['I'-'A'] = 1; a['V'-'A'] = 5; a['X'-'A'] = 10; a['L'-'A'] = 50; a['C'-'A'] = 100; a['D'-'A'] = 500; a['M'-'A'] = 1000; int sum = 0; int max = 1; for (int i = s.size() - 1; i >= 0; i--) { if (a[s[i]-'A'] >= max) { max = a[s[i]-'A']; sum += a[s[i]-'A']; }else{ sum -= a[s[i]-'A']; } } return sum;} 0 0
- 【leetcode c++】13 Roman to Integer
- [leetcode-13]Roman to Integer(C)
- 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
- 二叉树中序前序序列(或后序)求解树
- nyoj678
- 面向对象设计原则之四：依赖倒置原则
- C#之二十三 打印和水晶报表
- List和ListIterator的常见用法及特性
- leetcode 13 Roman to Integer C++
- TCPClient.py&TCPServer.py——自顶向下方法实例
- Java 学习笔记
- 找出1到n所有不重复的排列，即n的全排列。
- poj 1064 Cable master
- 移动开发生态渐成
- Java进阶学习第十一天——cookie&session入门
- 随想2016
- 通过UIWindow创建状态栏的通知
