leetcode (13) - ROMAN TO INT
来源:互联网 发布:战意首测激活码淘宝 编辑:程序博客网 时间:2024/05/28 05:18
class Solution {public: int romanToInt(string s) { int ret = toNumber(s[0]); for (int i = 1; i < s.length(); i++) { if (toNumber(s[i - 1]) < toNumber(s[i])) { ret += toNumber(s[i]) - 2 * toNumber(s[i - 1]); } else { ret += toNumber(s[i]); } } return ret; } int toNumber(char ch) { switch (ch) { 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; } return 0; }};
0 0
- leetcode (13) - ROMAN TO INT
- Leetcode-12 int to Roman
- leetcode (12) - INT TO ROMAN
- LeetCode算法题之int to Roman
- Int to Roman And Roman to Int
- 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
- JZOJ4841 平衡的子集
- 并发集合:ConcurrentHashMap
- 剖析Android SDK:Android组件详解
- nginx 代理多个服务器——多个server方式
- 第一天:JavaScript中没有块级作用域
- leetcode (13) - ROMAN TO INT
- mysql explain用法
- 查看linux磁盘空间
- 经典例题C语言程序解决数学问题
- caffe的网络结构存储在prototxt中,如何可视化网络?
- Cocos2d-lua示例(一)排行榜之ScrollView
- 利用IDEA创建Web Service服务端和客户端
- Hadoop安装教程_伪分布式配置_CentOS7.x/Hadoop2.7.3
- 制作gif小软件的使用